Vulnerability Measures of Transformation Graph <i>G</i><sup><i>xy</i>+</sup> (Q3455748): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Aysun Aytaç / rank
Normal rank
 
Property / author
 
Property / author: Tufan Turaci / rank
Normal rank
 
Property / author
 
Property / author: Aysun Aytaç / rank
 
Normal rank
Property / author
 
Property / author: Tufan Turaci / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong weak domination and domination balance in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The transformation graph \(G^{xyz}\) when \(xyz=-++\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformation graph \(G^{-+-}\) / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054115500379 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2118225737 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:13, 30 July 2024

scientific article
Language Label Description Also known as
English
Vulnerability Measures of Transformation Graph <i>G</i><sup><i>xy</i>+</sup>
scientific article

    Statements

    Vulnerability Measures of Transformation Graph <i>G</i><sup><i>xy</i>+</sup> (English)
    0 references
    11 December 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph vulnerability
    0 references
    connectivity
    0 references
    network design
    0 references
    communication
    0 references
    strong domination number
    0 references
    weak domination number
    0 references
    transformation graphs
    0 references
    0 references
    0 references
    0 references