Results 21 to 30 of about 39,337 (267)
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
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
D-magic strongly regular graphs
AKCE International Journal of Graphs and Combinatorics, 2020 For a set of distances D, a graph G on n vertices is said to be D-magic if there exists a bijection and a constant k such that for any vertex x, where is the D-neighbourhood set of x.
Rinovia Simanjuntak, Palton Anuwiksa
doaj +1 more source
On one infinite series of admissible intersection arrays of distance-regular graphs of diameter 5
Известия высших учебных заведений. Поволжский регион: Физико-математические науки, 2022 Background. One generalization of one known infinite series of admissible intersection arrays of a bipartite antipodal distance-regular graph is proposed for consideration.
I.T. Mukhamet'yanov
doaj +1 more source
On distance labelings of 2-regular graphs
Electronic Journal of Graph Theory and Applications, 2021 Let G be a graph with |V(G)| vertices and ψ : V(G) → {1, 2, 3, ... , |V(G)|} be a bijective function. The weight of a vertex v ∈ V(G) under ψ is wψ(v) = ∑u ∈ N(v)ψ(u). The function ψ is called a distance magic labeling of G, if wψ(v) is a constant for
Anak Agung Gede Ngurah +1 more
doaj +1 more source
On a version of the spectral excess theorem
Electronic Journal of Graph Theory and Applications, 2020 Given a regular (connected) graph G=(X,E) with adjacency matrix A, d+1 distinct eigenvalues, and diameter D, we give a characterization of when its distance matrix AD is a polynomial in A, in terms of the adjacency spectrum of G and the arithmetic (or ...
Miquel Àngel Fiol, Safet Penjic
doaj +1 more source
The distance seidel spectrum of some graph operations [PDF]
Journal of HyperstructuresThe distance matrix, distance eigenvalue, and distance energy of a connected graph have been studied in detail in literature where as the study on distance seidel matrix associated with a connected graph is in progress. The eigenvalues ∂1S≥∂2S≥ ...
Deena Scaria, Indulal Gopal
doaj +1 more source
Edge-distance-regular graphs are distance-regular
Journal of Combinatorial Theory, Series A, 2013 A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that every edge-distance-regular graph $\G$ is distance-regular and homogeneous.
Cámara Vallejo, Marc +4 more
openaire +5 more sources
Ural Mathematical Journal, 2021 The vertex distance complement (VDC) matrix \(\textit{C}\), of a connected graph \(G\) with vertex set consisting of \(n\) vertices, is a real symmetric matrix \([c_{ij}]\) that takes the value \(n - d_{ij}\) where \(d_{ij}\) is the distance between the
Ann Susa Thomas +2 more
doaj +1 more source
Distance-regular Subgraphs in a Distance-regular Graph, IV
European Journal of Combinatorics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources