On the minimum eccentric distance sum of bipartite graphs with some given parameters
نویسندگان
چکیده
منابع مشابه
The eccentric-distance sum of some graphs
Let G = (V,E) be a simple connected graph. The eccentric-distance sum of G is defined as ξ(G) = ∑ {u,v}⊆V (G) [e(u) + e(v)]d(u, v), where e(u) is the eccentricity of the vertex u in G and d(u, v) is the distance between u and v. In this paper, we establish formulae to calculate the eccentric-distance sum for some graphs, namely wheel, star, broom, lollipop, double star, friendship, multi-star g...
متن کاملMinimum Color Sum of Bipartite Graphs
The problem of minimum color sum of a graph is to color the vertices of the graph such that the sum (average) of all assigned colors is minimum. Recently, in [BBH+96], it was shown that in general graphs this problem cannot be approximated within n1 , for any > 0, unless NP = ZPP . In the same paper, a 9=8-approximation algorithm was presented for bipartite graphs. The hardness question for thi...
متن کاملEla on Bipartite Graphs Which Attain Minimum Rank among Bipartite Graphs with a given Diameter
The rank of a graph is defined to be the rank of its adjacency matrix. In this paper, the bipartite graphs that attain the minimum rank among bipartite graphs with a given diameter are completely characterized.
متن کاملOn bipartite graphs which attain minimum rank among bipartite graphs with given diameter
The rank of a graph is defined to be the rank of its adjacency matrix. In this paper, the bipartite graphs that attain the minimum rank among bipartite graphs with a given diameter are completely characterized.
متن کاملOn the Adjacent Eccentric Distance Sum Index of Graphs
For a given graph G, ε(v) and deg(v) denote the eccentricity and the degree of the vertex v in G, respectively. The adjacent eccentric distance sum index of a graph G is defined as [Formula in text], where [Formula in text] is the sum of all distances from the vertex v. In this paper we derive some bounds for the adjacent eccentric distance sum index in terms of some graph parameters, such as i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2015
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2015.05.032