Results 61 to 70 of about 1,557,851 (153)
Algebraic, geometric, and spectral properties of regular graphs
Cioabă, Sebastian M.In Chapter 1 we cover the notation and basic definitions used throughout this dissertation. We provide definitions, examples, and basic results for distance-regular graphs since the results of this dissertation are related to these ...
Gupta, Himanshu
core +1 more source
Strongly Regular Graphs with Parameters (4m4, 2m4 + m2, m4 + m2, m4 + m2) Exist for All m>1 [PDF]
Using results on Hadamard difference sets, we construct regular graphical Hadamard matrices of negative type of order 4m4 for every positive integer m. If m > 1, such a Hadamard matrix is equivalent to a strongly regular graph with parameters (4m4, 2m4 ...
Xiang, Q., Haemers, W.H.
core
summary:A graph $G$ is called locally $s$-regular if the neighbourhood of each vertex of $G$ induces a subgraph of $G$ which is regular of degree $s$. We study graphs which are locally $s$-regular and simultaneously regular of degree $r$
Zelinka, Bohdan
core +1 more source
Domination in 4-regular Knödel graphs
A subset D of vertices of a graph G is a dominating set if for each u ∈ V(G) ∖ D, u is adjacent to some vertex v ∈ D. The domination number, γ(G) of G, is the minimum cardinality of a dominating set of G.
Mojdeh Doost Ali, Musawi S.R., Nazari E.
doaj +1 more source
Spectral Characterization of the Hamming Graphs [PDF]
We show that the Hamming graph H(3; q) with diameter three is uniquely determined by its spectrum for q ¸ 36. Moreover, we show that for given integer D ¸ 2, any graph cospectral with the Hamming graph H(D; q) is locally the disjoint union of D copies of
Koolen, J.H., Bang, S., Dam, E.R. van
core
Kaleidoscopic Edge-Coloring of Complete Graphs and r-Regular Graphs
For an r-regular graph G, we define an edge-coloring c with colors from {1, 2, . . . , k}, in such a way that any vertex of G is incident with at least one edge of each color. The multiset-color cm(v) of a vertex v is defined as the ordered tuple (a1, a2,
Li Xueliang, Zhu Xiaoyu
doaj +1 more source
Developments on Spectral Characterizations of Graphs [PDF]
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core
Metrically regular square of metrically regular bipartite graphs of diameter $D = 7$ [PDF]
summary:The present paper deals with the spectra of powers of metrically regular graphs. We prove that there is only two tables of the parameters of an association scheme so that the corresponding metrically regular bipartite graph of diameter $D = 7$ (8
Vetchý, Vladimír
core +1 more source
The reflexive edge strength on some almost regular graphs. [PDF]
Agustin IH +4 more
europepmc +1 more source
More about Divisible Design Graphs [PDF]
: Divisible design graphs (DDG for short) have been recently defined by Kharaghani, Meulenberg and the second author as a generalization of (v, k, λ)-graphs.
Haemers, W.H., Crnkovic, D.
core

