A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Regular graphs with excess one
1981
Discrete Mathematics
Preserved Fulltext
It is she\-,ln that there exists no regular graph with excess __ = 1 and girth 2r + la 5. Let r be a regular graph with valency k and girth 2r + 1 (odd). Let H be the number of the vertices. ...
There exists no regular graph with excess e = 1 and girth 2r + 12 5 I We remark that if e = 1 and r = 1, then r is a cc&tail. party graph (namely, r= K2.2,. . , -). ...
There exists no regular graph with valency k and diameter r (2 2) and with defect I (except for an ordinary 4-gon with k = 2 and r = 2). ...
doi:10.1016/0012-365x(81)90215-6
fatcat:j5x7b2qyafebveesphrxhxo6p4
An odd characterization of the generalized odd graphs
2011
Journal of combinatorial theory. Series B (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We show that any connected regular graph with d+1 distinct eigenvalues and odd-girth 2d+1 is distance-regular, and in particular that it is a generalized odd graph. ...
Spectral excess theorem. Let Γ be a connected regular graph with d + 1 distinct eigenvalues. Then Γ is distance-regular if and only if the average excess equals the spectral excess. ...
In general it is not true that any connected regular graph with diameter D and odd-girth 2D + 1 is a generalized odd graph. ...
doi:10.1016/j.jctb.2011.03.001
fatcat:hxm5vcdr2vawndxpeapowqyzqm
An Odd Characterization of the Generalized Odd Graphs
2010
Social Science Research Network
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that any connected regular graph with d + 1 distinct eigenvalues and odd-girth 2d + 1 is distance-regular, and in particular that it is a generalized odd graph. ...
Spectral Excess Theorem. Let Γ be a connected regular graph with d+1 distinct eigenvalues. Then Γ is distance-regular if and only if the average excess equals the spectral excess. ...
To show the claimed characterization, we shall use the so-called spectral excess theorem due to Fiol and Garriga [10] . Let Γ be a connected k-regular graph with d + 1 distinct eigenvalues. ...
doi:10.2139/ssrn.1596575
fatcat:fcptnqhkkfdhvcr5pg3yvqayky
A spectral excess theorem for nonregular graphs
2012
Journal of combinatorial theory. Series A
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The spectral excess theorem asserts that the average excess is, at most, the spectral excess in a regular graph, and equality holds if and only if the graph is distance-regular. ...
For application, we demonstrate that a graph with odd-girth 2d + 1 must be distance-regular, generalizing a recent result of van Dam and Haemers. ...
Introduction Throughout this paper, let G = (V G, EG) be a connected graph on n vertices, with diameter D, adjacency matrix A, and distance function ∂. ...
doi:10.1016/j.jcta.2012.04.002
fatcat:iuo6rigapfhbhf4xyqsxez6y44
The Laplacian spectral excess theorem for distance-regular graphs
2014
Linear Algebra and its Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The spectral excess theorem states that, in a regular graph G, the average excess, which is the mean of the numbers of vertices at maximum distance from a vertex, is bounded above by the spectral excess ...
In this note we prove the corresponding result by using the Laplacian spectrum without requiring regularity of G. ...
The authors thank a referee for comments on an earlier version. ...
doi:10.1016/j.laa.2014.06.001
fatcat:qp6gmsvkbfcndmjb45qbr57lw4
A short proof of the odd-girth theorem
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Recently, it has been shown that a connected graph Γ with d+1 distinct eigenvalues and odd-girth 2d+1 is distance-regular. The proof of this result was based on the spectral excess theorem. ...
In this note we present an alternative and more direct proof which does not rely on the spectral excess theorem, but on a known characterization of distance-regular graphs in terms of the predistance polynomial ...
Introduction The spectral excess theorem [10] states that a regular graph Γ is distance-regular if and only if its spectral excess (a number which can be computed from the spectrum of Γ) equals its average ...
arXiv:1205.0153v1
fatcat:54gzbxq6jff4xccxdmevqva75q
1-factor covers of regular graphs
2011
Discrete Applied Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In particular, we classify cubic graphs such that every minimal 1-factor cover is also a 1-factorization, and also classify simple regular bipartite graphs with this property. ...
We consider minimal 1-factor covers of regular multigraphs, focusing on those that are 1-factorizations. ...
The results of this paper on regular graphs G with exc max (G) = 0 lead to more general questions about the excess range of regular graphs. The Petersen Graph has excess range [2, 2] . ...
doi:10.1016/j.dam.2010.12.003
fatcat:7ogewsinqrb4dhsolfkfk7vmw4
The Spectral Excess Theorem for Distance-Biregular Graphs
2013
Electronic Journal of Combinatorics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. ...
A bipartite graph $\Gamma$ is distance-biregular when it is distance-regular around each vertex and the intersection array only depends on the stable set such a vertex belongs to. ...
The author would like to thank the anonymous reviewer for helpful comments and corrections on a first version of this paper. ...
doi:10.37236/3305
fatcat:cx747r2fivfhbo7z67n2ap3xhm
Graphs of arbitrary excessive class
2011
Discrete Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We show that there exists a family of r-regular graphs of arbitrarily large excessive index for each integer r greater than 3. ...
Furthermore, we answer a question in Bonisoli and Cariolaro (2007) [1] showing that all the positive integers can be attained as excessive classes of regular graphs. ...
r-regular graphs of arbitrary large excessive class In this section we construct a family of r-regular graphs with excessive index arbitrarily large. We treat the cases of even and odd r separately. ...
doi:10.1016/j.disc.2010.09.016
fatcat:2gyel6viyzdttipyg7ndfaua5y
The spectral excess theorem for distance-regular graphs having distance-d graph with fewer distinct eigenvalues
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In particular, this is the case of antipodal distance-regular graphs (K with only two distinct eigenvalues), and the so-called half-antipodal distance-regular graphs (K with only one negative eigenvalue ...
This can be seen as a general version of the so-called spectral excess theorem, which allows us to characterize those distance-regular graphs which are half-antipodal, antipodal, bipartite, or with Kneser ...
Let Γ be a regular graph with n vertices, spectrum sp Γ as above, and mean excess k d . ...
arXiv:1409.5146v1
fatcat:kxbxblag7rebtajplgzfx663ra
Variations of the spectral excess theorem for normal digraphs
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Distance regularity of a digraph (also a graph) is in general not determined by its spectrum. ...
Specially we show that whether a given connected digraph to be weakly distance-regular only depends on the equality for two invariants. ...
On the other hand, among the triangle-free connected regular graphs with diameter two there are many graphs that are not strongly regular. ...
arXiv:1310.7382v1
fatcat:2lnfyhswbzhz5pwv3arjdqlcxy
A simple proof of the spectral excess theorem for distance-regular graphs
2010
Linear Algebra and its Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The spectral excess theorem provides a quasi-spectral characterization for a (regular) graph Γ with d + 1 distinct eigenvalues to be distance-regular graph, in terms of the excess (number of vertices at ...
In this paper we present a new simple projection method based in a global point of view, and where the mean excess plays an essential role. ...
Acknowledgements The authors wish to thank the support by the Ministry of Science and Technology (Spain) with the European Regional Development Fund under Projects MTM2005-08990-C02-01 and TEC2005-03575 ...
doi:10.1016/j.laa.2009.07.030
fatcat:v2aail7p6fecrebacbsuin4axy
Preface: Geometric and algebraic combinatorics
2012
Designs, Codes and Cryptography
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
On the other hand, many association schemes are interesting objects in themselves. This includes the strongly regular and distance-regular graphs. ...
On one hand it can be a tool for a better understanding of combinatorial objects, such as error correcting codes, block designs, point-line incidence geometries, and permutation groups. ...
They show that a distance-regular graph with large c 2 is bipartite, and that if the excess is small then the distance-regular graph is antipodal. 6. ...
doi:10.1007/s10623-012-9701-7
fatcat:ucoc7lfxvzdw7bbngw7ncfvvlq
The spectral excess theorem for distance-biregular graphs
[article]
2013
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. ...
A bipartite graph is distance-biregular when it is distance-regular around each vertex and the intersection array only depends on the stable set such a vertex belongs to. ...
Introduction The spectral excess theorem, due to Fiol and Garriga [12] , states that a regular (connected) graph Γ is distance-regular if and only if its spectral-excess (a number which can be computed ...
arXiv:1304.4354v1
fatcat:z3ghw6iwvjcitetnge5z2eznse
On some approaches to the spectral excess theorem for nonregular graphs
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
The Spectral Excess Theorem (SPET) for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. ...
corresponding distance-regularity property. ...
One of such versions concerns with the so-called pseudo-distance-regularity [17] , which is a natural generalization, for nonregular graphs, of the standard distance-regularity [1, 2] . ...
arXiv:1205.5859v1
fatcat:wtt3vkomo5dzjgwtgktzkdtmyq
« Previous
Showing results 1 — 15 out of 127,821 results