Super-connected and hyper-connected jump graphs (Q3545667): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Superconnectivity of bipartite digraphs and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of reliable networks - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On unreliability polynomials and graph connectivity in reliable network synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph distances in graphs defined by edge transfers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The superconnectivity of large digraphs and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of vertex and edge transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian jump graphs / rank
 
Normal rank

Latest revision as of 22:39, 28 June 2024

scientific article
Language Label Description Also known as
English
Super-connected and hyper-connected jump graphs
scientific article

    Statements

    Identifiers