Results 31 to 40 of about 542,793 (319)
Hosoya properties of the commuting graph associated with the group of symmetries
Main Group Metal Chemistry, 2021 A vast amount of information about distance based graph invariants is contained in the Hosoya polynomial. Such an information is helpful to determine well-known distance based molecular descriptors.
Abbas Ghulam +4 more
doaj +1 more source
A note on incomplete regular tournaments with handicap two of order n≡8(mod 16) [PDF]
Opuscula Mathematica, 2017 A \(d\)-handicap distance antimagic labeling of a graph \(G=(V,E)\) with \(n\) vertices is a bijection \(f:V\to \{1,2,\ldots ,n\}\) with the property that \(f(x_i)=i\) and the sequence of weights \(w(x_1),w(x_2),\ldots,w(x_n)\) (where \(w(x_i)=\sum_{x_i
Dalibor Froncek
doaj +1 more source
Electronic Journal of Graph Theory and Applications, 2015 We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones.
C. Dalfo, M. A. Fiol, M. Mitjana
doaj +1 more source
The Q-polynomial idempotents of a distance-regular graph
Journal of Combinatorial Theory Series B, 2010 Aleksandar Jurisic +2 more
semanticscholar +3 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
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
An inequality involving the second largest and smallest eigenvalue of a distance-regular graph [PDF]
, 2010 For a distance-regular graph with second largest eigenvalue (resp., smallest eigenvalue) θ 1 (resp., θ D ) we show that ( θ 1 + 1 ) ( θ D + 1 ) ⩽ - b 1 holds, where equality only holds when the diameter equals two. Using this inequality we study distance-
J. Koolen, Jongyook Park, Hyonju Yu
semanticscholar +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
Structure of thin irreducible modules of a Q-polynomial distance-regular graph [PDF]
, 2010 Let Γ be a Q-polynomial distance-regular graph with vertex set X, diameter D⩾3 and adjacency matrix A. Fix x∈X and let A∗=A∗(x) be the corresponding dual adjacency matrix.
Diana R. Cerzo
semanticscholar +1 more source