Results 41 to 50 of about 41,123 (303)
AN UPPER BOUND ON THE CHEEGER CONSTANT OF A DISTANCE-REGULAR GRAPH [PDF]
, 2017 We present an upper bound on the Cheeger constant of a distance-regular graph. Recently, the authors found an upper bound on the Cheeger constant of distance-regular graph under a certain restriction in their previous work.
이윤진
core +1 more source
An upper bound on the Cheeger constant of a distance-regular graph [PDF]
, 2018 We present an upper bound on the Cheeger constant of a distance-regular graph. Recently, the authors found an upper bound on the Cheeger constant of distance-regular graph under a certain restriction in their previous work.
이윤진
core +1 more source
On 3-Chromatic Distance-Regular Graphs [PDF]
SSRN Electronic Journal, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aart Blokhuis +2 more
openaire +11 more sources
A Cheeger inequality of a distance regular graph using Green's function [PDF]
, 2017 Cheeger constant; Cheeger inequality; Distance regular graph; Green's function; Laplacian; P-polynomial ...
이윤진
core +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
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
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
A distance regular graph with intersection array (21,16,8; 1,4,14) does not exist [PDF]
, 2005 We show that a distance regular graph Γ with intersection array (21,16,8;1,4,14) does not exist. The proof uses algebraic properties of a positive semidefinite matrix related to the neighbourhood of a vertex of ...
Coolsaet, Kris, Coolsaet, K.
core +1 more source
A new distance-regular graph associated to the Mathieu group M10 [PDF]
, 1998 We construct a bipartite distance-regular graph with intersection array {45, 44, 36, 5; 1, 9, 40, 45} and automorphism group 35 :(2 ×M10) (acting edge-transitively) and discuss its relation to previously known combinatorial ...
Koolen, J.H. +2 more
core +1 more source
The Terwilliger polynomial of a Q-polynomial distance-regular graph and its application to pseudo-partition graphs [PDF]
, 2015 Distance-regular graph; Folded halved cube; Folded Johnson graph; Q-polynomial; Terwilliger ...
Gavrilyuk, Alexander L., Koolen, Jack H.
core +1 more source