Super edge-connectivity of de Bruijn and Kautz undirected graphs (Q1769572): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q126211421, #quickstatements; #temporary_batch_1725416833384
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11766-004-0011-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017963905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of network reliability computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of Kautz networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant Routing in DeBruijn Comrnunication Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing a conditional edge-connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximally connected digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4260012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined connectivity properties of abelian Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3148111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super edge-connectivity of dense digraphs and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435203 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126211421 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:31, 4 September 2024

scientific article
Language Label Description Also known as
English
Super edge-connectivity of de Bruijn and Kautz undirected graphs
scientific article

    Statements

    Super edge-connectivity of de Bruijn and Kautz undirected graphs (English)
    0 references
    0 references
    0 references
    4 April 2005
    0 references
    The authors prove that the Kautz undirected graph is super edge-connected. A shorter proof of Lu and Zhang's result on super edge-connectivity of the de Bruijn undirected graphs is provided.
    0 references
    0 references
    super edge-connectivity
    0 references
    de Bruijn graphs
    0 references
    Kautz graphs
    0 references
    0 references
    0 references