Results 121 to 130 of about 3,088,840 (140)
Some of the next articles are maybe not open access.
Generalized distance spectral radius of some t-partitioned transmission regular graphs
Asian-European Journal of MathematicsLet [Formula: see text] be an [Formula: see text]-vertex connected graph with the distance matrix [Formula: see text] and the diagonal matrix of transmissions [Formula: see text]. The generalized distance matrix of a connected graph [Formula: see text] is [Formula: see text], where [Formula: see text], [Formula: see text].
Aditi Howlader, Pratima Panigrahi
openaire +1 more source
The method of determining of transmission properties of networks based on regular graphs topology
Zeszyty Naukowe, Telekomunikacja i Elektronika, Scientific Journal, Telecommunications and Electronics, 2014Ledziński, Damian +2 more
openaire +1 more source
A walk-regular graph, cospectral to its complement, need not be strongly regular
Discrete Mathematics, 2023Sanja Stevanović
exaly
There is no (95, 40, 12, 20) strongly regular graph
Journal of Combinatorial Designs, 2020Jernej Azarija, Tilen Marc
exaly
Strongly regular graphs decomposable into a divisible design graph and a Hoffman coclique
Designs, Codes, and Cryptography, 2023Vladislav Kabanov
exaly
On the E-Optimality of Regular Graph Designs
Journal of the Royal Statistical Society Series B: Methodological, 1980Mike Jacroux
exaly
Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph
Graphs and Combinatorics, 2007Michael A. Henning, Anders Yeo
exaly
Strongly Regular Decompositions of the Complete Graph
Journal of Algebraic Combinatorics, 2003Edwin Robert van Dam
exaly
Arc-transitive abelian regular covers of the Heawood graph
Journal of Algebra, 2013Jicheng Ma, Marston Conder
exaly
An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
Linear Algebra and Its Applications, 2011Jack Koolen, Jongyook Park
exaly