Maximum genus and maximum nonseparating independent set of a 3-regular graph (Q1377685): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 15:11, 31 January 2024

scientific article
Language Label Description Also known as
English
Maximum genus and maximum nonseparating independent set of a 3-regular graph
scientific article

    Statements

    Maximum genus and maximum nonseparating independent set of a 3-regular graph (English)
    0 references
    0 references
    0 references
    26 January 1998
    0 references
    Let \(G\) be a connected graph with vertex set \(V\). A set \(J\subseteq V\) is called a nonseparating independent set (nsis) if \(J\) is an independent set of \(G\) and \(G-J\) is connected. The nsis number of \(G\), \(z(G)\), is the maximum cardinality that an nsis for \(G\) can attain. The authors show that, for \(G\) a 3-regular connected graph, the maximum genus is equal to \(z(G)\). This is then used to obtain several new results about the maximum genus parameter.
    0 references
    nonseparating independent set
    0 references
    maximum genus
    0 references

    Identifiers