Calculation of the accessibility number and the neighbor integrity of a graph (Q2508731): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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/s11006-005-0166-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993384316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4374715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The neighbour-integrity of boolean graphs and its compounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the neighbour-integrity of sequential joined graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability measures of some static interconnection networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rabin numbers of Butterfly networks / rank
 
Normal rank

Latest revision as of 21:56, 24 June 2024

scientific article
Language Label Description Also known as
English
Calculation of the accessibility number and the neighbor integrity of a graph
scientific article

    Statements

    Calculation of the accessibility number and the neighbor integrity of a graph (English)
    0 references
    0 references
    0 references
    0 references
    20 October 2006
    0 references
    communication network
    0 references
    vulnerability
    0 references
    stability
    0 references
    connectivity
    0 references
    accessibility and neighborhood integrity of
    0 references
    graph
    0 references
    Butterfly and omega networks
    0 references

    Identifiers