COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS (Q3569273): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Aysun Aytaç / rank
Normal rank
 
Property / author
 
Property / author: Aysun Aytaç / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of integrity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a class of posets and the corresponding comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rupture degree of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between rupture degree and other parameters / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:03, 2 July 2024

scientific article
Language Label Description Also known as
English
COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS
scientific article

    Statements

    COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS (English)
    0 references
    0 references
    0 references
    18 June 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    connectivity
    0 references
    network design and communication
    0 references
    vulnerability parameters
    0 references
    rupture degree
    0 references
    network damage
    0 references