Results 21 to 30 of about 251,114 (266)
On the Distance Pattern Distinguishing Number of a Graph
Journal of Applied Mathematics, 2014 Let G=(V,E) be a connected simple graph and let M be a nonempty subset of V. The M-distance pattern of a vertex u in G is the set of all distances from u to the vertices in M.
Sona Jose, Germina K. Augustine
doaj +1 more source
The distance spectrum of corona and cluster of two graphs
AKCE International Journal of Graphs and Combinatorics, 2015 Let G be a connected graph with a distance matrix D. The D-eigenvalues {μ1,μ2,…,…,μp} of G are the eigenvalues of D and form the distance spectrum or D-spectrum of G.
G. Indulal, Dragan Stevanović
doaj +1 more source
Distance-unbalancedness of graphs [PDF]
Applied Mathematics and Computation, 2021 14 pages, 3 ...
Miklavič, Štefko, Šparl, Primož
openaire +2 more sources
The Edit Distance Function of Some Graphs
Discussiones Mathematicae Graph Theory, 2020 The edit distance function of a hereditary property is the asymptotically largest edit distance between a graph of density p ∈ [0, 1] and . Denote by Pn and Cn the path graph of order n and the cycle graph of order n, respectively. Let C2n*C_{2n}^* be
Hu Yumei, Shi Yongtang, Wei Yarong
doaj +1 more source
Optimizing Distance Computation in Distributed Graph Systems
IEEE Access, 2020 Given a large graph, such as a social network or a knowledge graph, a fundamental query is how to find the distance from a source vertex to another vertex in the graph.
Qing Wang +5 more
doaj +1 more source
The distance coloring of graphs [PDF]
Acta Mathematica Sinica, English Series, 2014 Let $G$ be a connected graph with maximum degree $Δ\ge 3$. We investigate the upper bound for the chromatic number $χ_γ(G)$ of the power graph $G^γ$. It was proved that $χ_γ(G) \leΔ\frac{(Δ-1)^γ-1}{Δ-2}+1=:M+1$ with equality if and only $G$ is a Moore graph.
Miao, Lian Ying, Fan, Yi Zheng
openaire +2 more sources
The matching polynomial of a distance-regular graph
International Journal of Mathematics and Mathematical Sciences, 2000 A distance-regular graph of diameter d has 2d intersection numbers that determine many properties of graph (e.g., its spectrum). We show that the first six coefficients of the matching polynomial of a distance-regular graph can also be determined from ...
Robert A. Beezer, E. J. Farrell
doaj +1 more source
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
ON DISTANCE-i-GRAPHS OF DISTANCE-REGULAR GRAPHS
Kyushu Journal of Mathematics, 1994 Let \(G\) be a graph. The distance \(i\)-graph of \(G\) is the graph \(G_ i\) defined on the vertex set of \(G\), and \(u\) and \(v\) are adjacent if and only if the distance between \(u\) and \(v\) is \(i\). This paper studies the distance \(i\)-graph of a distance regular graph and its connected component, and obtains a lot of special features of the
openaire +2 more sources
Annals of Combinatorics, 2008 Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: The number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained.
Jerebic, Janja +2 more
openaire +2 more sources