\(r\)-bounded \(k\)-complete bipartite bihypergraphs and generalized split graphs (Q1598808)

From MaRDI portal
Revision as of 06:04, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
\(r\)-bounded \(k\)-complete bipartite bihypergraphs and generalized split graphs
scientific article

    Statements

    \(r\)-bounded \(k\)-complete bipartite bihypergraphs and generalized split graphs (English)
    0 references
    28 May 2002
    0 references
    The set of all induced subgraphs of a graph \(G\) will be denoted by \(\text{ISub}(G)\). A class \(\mathbb{P}\) of graphs is called hereditary if \(\text{ISub}(G)\subseteq\mathbb{P}\) for all \(G\in \mathbb{P}\). Let \(Z\) be a set of graphs, and set \(\text{FIS}(Z)= \{G\mid \text{ISub}(G)\cap Z=\varnothing\}\). We say that a class \(\mathbb{P}\) is finitely generated if \(\mathbb{P}= \text{FIS}(Z)\) for a finite set \(Z\). A class \(\mathbb{P}\) of graphs is called \(\alpha\)-bounded (resp. \(\omega\)-bounded) if there exists a constant \(c\) such that \(\alpha(G)\leq c\) (resp. \(\omega(G)\leq c\)) for all \(G\in\mathbb{P}\). The \((\alpha,\beta)\)-polar graphs are a generalization of the split graphs (the class of split graphs coincides with the class of \((1,1)\)-polar graphs). The main result of this article shows that every class of \((\alpha,\beta)\)-polar graphs has a finite FIS-characterization. This result generalizes some well-known results about this type of graph.
    0 references
    0 references

    Identifiers