Results 21 to 30 of about 41,123 (303)
A relationship between the diameter and the intersection number c (2) for a distance-regular graph [PDF]
, 2018 In this paper we will look at the relationship between the intersection number c (2) and the diameter of a distance-regular graph. We also give some tools to show that a distance-regular graph with large c (2) is bipartite, and a tool to show that if k ...
Koolen, JH, Park, J
core +1 more source
Tạp chí Khoa học Đại học Đà Lạt, 2013 A regular graph is a graph where each vertex has the same degree. A regular graph with vertices of degree k is called a k -regular graph or regular graph of degree k.
Đỗ Như An, Nguyễn Đình Ái
doaj +1 more source
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
Some inequalities involving the distance signless Laplacian eigenvalues of graphs [PDF]
Transactions on Combinatorics, 2021 Given a simple graph $G$, the distance signlesss Laplacian $D^{Q}(G)=Tr(G)+D(G)$ is the sum of vertex transmissions matrix $Tr(G)$ and distance matrix $D(G)$.
Abdollah Alhevaz +3 more
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 +4 more sources
Characterizing Distance-Regularity of Graphs by the Spectrum [PDF]
SSRN Electronic Journal, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edwin R. van Dam +3 more
openaire +8 more sources
An inequality between intersection numbers of a distance-regular graph [PDF]
, 1987 Let ai, bi, and ci be the usual intersection numbers of a distance-regular graph.
Nomura, Kazumasa
core +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
3-bounded Property in a Triangle-free Distance-regular Graph [PDF]
, 2007 Let Γ denote a distance-regular graph with classical parameters (D, b, α, β) and D ≥ 3. Assume the intersection numbers a1 = 0 and a2 = 0.
Chih-wen Weng +3 more
core +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