Total irredundance in graphs (Q1849917): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Odile Favaron / rank
Normal rank
 
Property / author
 
Property / author: Odile Favaron / 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.1016/s0012-365x(00)00459-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992868998 / rank
 
Normal rank

Latest revision as of 10:15, 30 July 2024

scientific article
Language Label Description Also known as
English
Total irredundance in graphs
scientific article

    Statements

    Total irredundance in graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 December 2002
    0 references
    A set \(S\) of vertices in a graph \(G\) is called a total irredundant set, if for each vertex \(v\) in \(G\) either \(v\) or one of its neighbours has no neighbour in \(S\setminus \{ v\}\). The authors study the minimum cardinality \(\text{ir}_t(G)\) and the maximum cardinality \(\text{IR}_t(G)\) of maximal irredundant sets in \(G\). They determine \(\text{ir}_t\) and \(\text{IR}_t\) for several special graphs, characterize the graphs \(G\) with \(\text{ir}_T(G)=0\) in terms of neighbourhood conditions and prove some lower bounds on \(\text{ir}_T\) for regular graphs. Furthermore, they characterize the trees \(T\) with \(\text{ir}_t(T)=1\) and prove some simple upper bounds on \(\text{ir}_T\) and \(\text{IR}_T\). The paper closes with a series of open problems.
    0 references
    total irredundance
    0 references

    Identifiers