Remoteness and distance eigenvalues of a graph
نویسندگان
چکیده
منابع مشابه
Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph
Let G be a connected graph of order n. The remoteness of G, denoted by ρ, is the maximum average distance from a vertex to all other vertices. Let [Formula: see text], [Formula: see text] and [Formula: see text] be the distance, distance Laplacian and distance signless Laplacian eigenvalues of G, respectively. In this paper, we give lower bounds on [Formula: see text], [Formula: see text], [For...
متن کاملAverage distance , radius and remoteness of a graph ∗
Let G = (V,E) be a connected graph on n vertices. Denote by l̄(G) the average distance between all pairs of vertices in G. The remoteness ρ(G) of a connected graph G is the maximum average distance from a vertex of G to all others. The aim of this paper is to show that two conjectures in [5] concerned with average distance, radius and remoteness of a graph are true.
متن کاملThe local eigenvalues of a bipartite distance-regular graph
We consider a bipartite distance-regular graph Γ with vertex set X, diameter D ≥ 4, and valency k ≥ 3. For 0 ≤ i ≤ D, let Γ i (x) denote the set of vertices in X that are distance i from vertex x. We assume there exist scalars r, s, t ∈, not all zero, such that r|Γ 1 (x) ∩ Γ 1 (y) ∩ Γ 2 (z)| + s|Γ 2 (x) ∩ Γ 2 (y) ∩ Γ 1 (z)| + t = 0 let Γ 2 2 denote the graph with vertex set˜X = {y ∈ X | ∂(x, y)...
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.07.018