| Title:
|
Note on independent sets of a graph (English) |
| Author:
|
Ivančo, Jaroslav |
| Language:
|
English |
| Journal:
|
Mathematica Bohemica |
| ISSN:
|
0862-7959 (print) |
| ISSN:
|
2464-7136 (online) |
| Volume:
|
119 |
| Issue:
|
4 |
| Year:
|
1994 |
| Pages:
|
385-386 |
| Summary lang:
|
English |
| . |
| Category:
|
math |
| . |
| Summary:
|
Let the number of $k$-element sets of independent vertices and edges of a graph $G$ be denoted by $n(G,k)$ and $m(G,k)$, respectively. It is shown that the graphs whose every component is a circuit are the only graphs for which the equality $n(G,k)=m(G,k)$ is satisfied for all values of $k$. (English) |
| Keyword:
|
independent sets |
| Keyword:
|
circuit |
| MSC:
|
05C38 |
| MSC:
|
05C75 |
| idZBL:
|
Zbl 0812.05053 |
| idMR:
|
MR1316591 |
| DOI:
|
10.21136/MB.1994.126117 |
| . |
| Date available:
|
2009-09-24T21:07:21Z |
| Last updated:
|
2020-07-29 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/126117 |
| . |
| Reference:
|
[1] I. Gutman: On independent vertices and edges of a graph.Topics in Combinatorics and Graph Theory (R. Bodendiek and R. Henn, eds.). Physica-Verlag, Heidelberg, 1990, pp. 291-296. Zbl 0697.05038, MR 1100048 |
| Reference:
|
[2] F. Harary: Graph Theory.Addison-Wesley, Reading, MA, 1969. Zbl 0196.27202, MR 0256911 |
| . |
