The neighbour-integrity of boolean graphs and its compounds (Q4944661): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Pinar Dundar / rank
Normal rank
 
Property / author
 
Property / author: Pinar Dundar / rank
 
Normal rank
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.1080/00207169908804867 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969859239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of integrity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Toughness of a Graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:47, 29 May 2024

scientific article; zbMATH DE number 1420186
Language Label Description Also known as
English
The neighbour-integrity of boolean graphs and its compounds
scientific article; zbMATH DE number 1420186

    Statements

    The neighbour-integrity of boolean graphs and its compounds (English)
    0 references
    21 March 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    communication networks
    0 references
    vulnerability measure
    0 references
    Boolean graphs
    0 references
    0 references
    0 references
    0 references
    0 references