On bipartite distance-regular graphs with a strongly closed subgraph of diameter three (Q607010): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2010.08.019 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3218140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight distance-regular graphs with respect to subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subconstituent algebra of a strongly regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strongly closed subgraphs with diameter two and the \(Q\)-polynomial property / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2010.08.019 / rank
 
Normal rank

Latest revision as of 22:09, 9 December 2024

scientific article
Language Label Description Also known as
English
On bipartite distance-regular graphs with a strongly closed subgraph of diameter three
scientific article

    Statements

    On bipartite distance-regular graphs with a strongly closed subgraph of diameter three (English)
    0 references
    0 references
    0 references
    19 November 2010
    0 references
    \textit{R. Hosoya} and \textit{H. Suzuki} [Eur. J. Comb. 28, No. 1, 61--74 (2007; Zbl 1105.05075)] obtained an upper bound on the second largest eigenvalue of a distance-regular \(G\) graph with a strongly closed regular subgraph \(Y\) of diameter 2. In this paper the authors provide the same type of result in the case when \(G\) is also bipartite and \(Y\) is of diameter 3.
    0 references
    distance regular graphs
    0 references
    strongly closed subgraphs
    0 references
    0 references

    Identifiers