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
Distance-regularised graphs are distance-regular or distance-biregular
1987
Journal of combinatorial theory. Series B (Print)
Preserved Fulltext
These graphs are shown to either be distance-regular or fall into a family of bipartite graphs called distance-biregular. This family includes the generalised polygons and other interesting graphs. ...
Despite this increased generahty we are also able to extend much of the basic theory of distance-regular graphs to our wider class of graphs. ...
In this paper we show that a distance-regularised graph is either distance-regular or is a bipartite semiregular graph from which we can derive two distance-regular graphs. ...
doi:10.1016/0095-8956(87)90027-x
fatcat:jueemxhr4bgizayytbzt5nase4
Pseudo-distance-regularised graphs are distance-regular or distance-biregular
[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.
In this note, we prove that a pseudo-distance-regular graph around each of its vertices is either distance-regular or distance-biregular. ...
The concept of pseudo-distance-regularity around a vertex of a graph is a natural generalization, for non-regular graphs, of the standard distance-regularity around a vertex. ...
The authors of [14] used a combinatorial approach to prove that distance-regularised graphs are either distance-regular or distance-biregular. For some properties of the latter, see Delorme [7] . ...
arXiv:1205.5687v1
fatcat:m6aprsayjnachptw4m2svmmhzi
Coverings of complete bipartite graphs and associated structures
1994
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.
Relations with associated distance-biregular graphs are also considered, resulting in the construction of a family of distance-bitransitive graphs. ...
A construction is given of distance-regular q-fold covering graphs of the complete bipartite graph K qk"pk, where q is the power of a prime number and k is any positive integer. ...
It has been shown that a distance-regularised graph is either distance-regular or distance-biregular [S]. ...
doi:10.1016/0012-365x(93)e0070-k
fatcat:qz7ry2z2czhzpiu3xnqp5feuia
The M-matrix group inverse problem for distance-biregular graphs
[article]
2022
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 2022; you can also visit the original URL.
The file type is application/pdf.
We also show that the two equilibrium arrays characterizing a distance-biregular graph can be expressed in terms of the mentioned equilibrium measures. ...
In this paper we provide the group inverse of the combinatorial Laplacian matrix of distance-biregular graphs using the so-called equilibrium measures for sets obtained by deleting a vertex. ...
These graphs are shown to either be distance-regular or distance-biregular. This family includes the generalised polygons and other interesting graphs. ...
arXiv:2204.13186v1
fatcat:wxlxdvzewjcvbeccnidlkpkjmu
Automorphism Groups of Primitive Distance-Bitransitive Graphs are Almost Simple
1987
European journal of combinatorics (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.
These graphs are called distance-biregular. It is shown in [2] that distance-regularised graphs are distance-regular or distance-biregular. ...
Distance-bitransitive graphs are clearly distance-biregular, as distance-transitive graphs are distance-regular. ...
doi:10.1016/s0195-6698(87)80010-0
fatcat:lstcpsfrqbhvbnrdqte7tvw344
Page 5062 of Mathematical Reviews Vol. , Issue 88j
[page]
1988
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Caccetta (5-CURT)
05 COMBINATORICS
88j:05037 05C75
Godsil, Chris D. (3-SFR); Shawe-Taylor, John (4-LNDHB-S) Distance-regularised graphs are distance-regular or distance-biregular.
J. Combin. ...
Then the distance-regularised graphs introduced in the paper under review are a common generalisa- tion of distance-regular graphs and generalised polygons. ...
On $Q$-Polynomial Association Schemes of Small Class
2012
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 2017; you can also visit the original URL.
The file type is application/pdf.
Our method is based on tridiagonal matrices and can be applied to distance-regular graphs as well. ...
We show an inequality involving the third largest or second smallest dual eigenvalues of $Q$-polynomial association schemes of class at least three. ...
It was proven in [13] that a distance regularized graph Γ is either distance-regular or distance-biregular. ...
doi:10.37236/2157
fatcat:txbectt3qfh7pldvq5gcf6qbyi
On Q-polynomial association schemes of small class
[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.
Our method is based on tridiagonal matrices and can be applied to distance-regular graphs as well. ...
We show an inequality involving the third largest or second smallest dual eigenvalues of Q-polynomial association schemes of class at least three. ...
It was proven in [13] that a distance regularized graph Γ is either distanceregular or distance-biregular. ...
arXiv:1202.5627v1
fatcat:yqpdct4z5ra3rmck75nk2rl3j4
Edge-distance-regular graphs
2011
Electronic Notes in 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.
Finally, it is shown that every nonbipartite graph which is both distance-regular and edge-distance-regular is a generalized odd graph. ...
Also, the analogue of the spectral excess theorem for distance-regular graphs is proved, so giving a quasi-spectral characterization of edge-distance-regularity. ...
They showed that distance-regularised graphs are either distance-regular or distancebiregular. Inspired by this, we introduce the following concept. ...
doi:10.1016/j.endm.2011.09.037
fatcat:y62ahldudjh2ldcaaoqw7kyd2a
Edge-distance-regular graphs
2011
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 2019; you can also visit the original URL.
The file type is application/pdf.
Finally, it is shown that every nonbipartite graph which is both distance-regular and edge-distance-regular is a generalized odd graph. ...
Also, the analogue of the spectral excess theorem for distance-regular graphs is proved, so giving a quasi-spectral characterization of edge-distance-regularity. ...
(These graphs are a common generalization of distance-regular graphs and generalized polygons.) Such authors showed that distance-regularised graphs are either distanceregular or distance-biregular. ...
doi:10.1016/j.jcta.2011.04.011
fatcat:6eehydtpwndw7g54w4eeryh36q
Spectral gap in random bipartite biregular graphs and applications
2021
Combinatorics, probability & computing
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 2021; you can also visit the original URL.
The file type is application/pdf.
We prove an analogue of Alon's spectral gap conjecture for random bipartite, biregular graphs. ...
A by-product of our main theorem is that random rectangular zero-one matrices with fixed row and column sums are full rank with high probability. ...
We are grateful to our anonymous reviewers for useful comments and suggestions, and at least in one case for pointing out errors in an earlier version of this manuscript (which have since been fixed). ...
doi:10.1017/s0963548321000249
fatcat:nxoihwusrngjbksvpsusxnuamq
Equidistribution and counting under equilibrium states in negative curvature and trees. Applications to non-Archimedean Diophantine approximation
[article]
2019
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.
Other Versions
Assume that X is a regular or biregular simplicial tree with degrees at least 3, and that Γ is a lattice of X. (1) For every simplicial subtree D of X, we have π˚r σD " ÿ xPV X }µ x } codeg D pxq deg X ...
For all j, k P N, a graph X is k-regular if the degree of each vertex x P V X is k, and it is pj, kq-biregular if it is bipartite with the elements of the partition of its vertices into two subsets having ...
Hence, taking s large enough, we may assume that H and γH 1 are disjoint, and that H and H 1 are disjoint or equal. ...
arXiv:1612.06717v2
fatcat:s6ldtzfr2ndjlg4r2cjhoybt4i
Page 1016 of Mathematical Reviews Vol. , Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Distance-regularised are distance-regular or distance-biregular. J. Combin. Theory Ser. B 43 (1987), no. 1, 14-24. ...
Cubic distance-regular graphs. J. London Math. Soc. (2) 33 (1986), no. 3, 385-394. (From the text) 884:05135 05C75
Automorphism groups of primitive distance-bitransitive graphs are almost simple. ...
Page 368 of Mathematical Reviews Vol. , Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Ars Combin. 23 (1987), A, 29-34. (R. C. Mullin) 884:05020 05B05 (05C70)
(with Shawe-Taylor, John) Distance-regularised graphs are distance-regular or distance-biregular. J. Combin. Theory Ser. ...
(Notin MR) 93B30 (93B40, 93C10)
Godin, Paul On the analytic regularity of weak solutions of analytic systems of conservation laws with analytic data. ...
A Dynamic Survey of Graph Labeling
2016
the electronic journal of combinatorics
unpublished
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.
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the mid 1960s. ...
has been done for any particular kind of labeling and keeping up with new discoveries is difficult because of the sheer number of papers and because many of the papers have appeared in journals that are ...
product of C 4 or C 8 and a regular graph is group distance magic; and they show that C 8 × G is also group distance magic for any even-regular graph G. ...
fatcat:4mvryyua2bfchoj2a3k3ojv57i
« Previous
Showing results 1 — 15 out of 19 results