Distances and diameters on iterated clique graphs (Q1827868): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q324826
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Miguel A. Pizaña / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally 4‐by‐4 grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique convergent graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new infinite series of regular uniformly geodetic code graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Johnson graphs satisfy a distance extension property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique graphs of time graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique divergent graphs with unbounded sequence of diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally \(C_6\) graphs are clique divergent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of Grassmann and Johnson graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On iterated clique graphs with increasing diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: The icosahedron is clique divergent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\) / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(03)00379-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055355518 / rank
 
Normal rank

Latest revision as of 08:29, 30 July 2024

scientific article
Language Label Description Also known as
English
Distances and diameters on iterated clique graphs
scientific article

    Statements

    Distances and diameters on iterated clique graphs (English)
    0 references
    6 August 2004
    0 references
    Iterated clique graphs
    0 references
    Distances
    0 references
    Diameters
    0 references
    Johnson graphs
    0 references
    0 references

    Identifiers