منابع مشابه
ON DEGREES OF END NODES AND CUT NODES IN FUZZY GRAPHS
The notion of strong arcs in a fuzzy graph was introduced byBhutani and Rosenfeld in [1] and fuzzy end nodes in the subsequent paper[2] using the concept of strong arcs. In Mordeson and Yao [7], the notion of“degrees” for concepts fuzzified from graph theory were defined and studied.In this note, we discuss degrees for fuzzy end nodes and study further someproperties of fuzzy end nodes and fuzz...
متن کاملAnalyzing graphs by degrees
Let G = (V, E) be a graph and let N(v) = {u : uv ∈ E} be the open neighborhood of a vertex v ∈ V . The degree of v, deg(v) = |N(v)|, equals the number of vertices u that are adjacent to v. By considering the relationships between deg(v) and the degrees deg(u), for every u ∈ N(v), we define 10 types of vertices and study some of their properties.
متن کاملVertex Degrees in Planar Graphs
For a planar graph on n vertices we determine the maximum values for the following: 1) the sum of the m largest vertex degrees. 2) the number of vertices of degree at least k. 3) the sum of the degrees of vertices with degree at least k.
متن کاملVertex Degrees in Outerplanar Graphs
For an outerplanar graph on n vertices, we determine the maximum number of vertices of degree at least k. For k = 4 (and n ≥ 7) the answer is n−4. For k = 5 (and n ≥ 4), the answer is ⌊
متن کاملOn ev-degree and ve-degree topological indices
Recently two new degree concepts have been defined in graph theory: ev-degree and ve-degree. Also the evdegree and ve-degree Zagreb and Randić indices have been defined very recently as parallel of the classical definitions of Zagreb and Randić indices. It was shown that ev-degree and ve-degree topological indices can be used as possible tools in QSPR researches . In this paper we d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.07.008