Cyclomatic numbers of connected induced subgraphs (Q1199496): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Research problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank |
Latest revision as of 16:17, 16 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cyclomatic numbers of connected induced subgraphs |
scientific article |
Statements
Cyclomatic numbers of connected induced subgraphs (English)
0 references
16 January 1993
0 references
For a graph \(G=\bigl( V(G),E(G) \bigr)\), the cyclomatic number \(cy(G)\) is defined by \(cy(G)=| E(G) |-| V(G) |+1\). Let \(A\) be an independent set of vertices of \(G\) and let \(C(A)\) be the collection of all connected induced subgraphs of \(G\) which contain \(A\). Define \(\omega(A)=\min \bigl\{ cy(H):H \in C(A) \bigr\}\). The author obtains upper bounds for \(\omega(A)\) over the class of graphs and over the class of triangle-free graphs. He also considers the edge version of the question and shows that all upper bounds are best possible.
0 references
cyclomatic number
0 references
independent set
0 references
induced subgraphs
0 references
upper bounds
0 references