Note on independent sets of a graph
Mathematica Bohemica, Tome 119 (1994) no. 4, pp. 385-386
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
MR Zbl
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$.
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$.
Ivančo, Jaroslav. Note on independent sets of a graph. Mathematica Bohemica, Tome 119 (1994) no. 4, pp. 385-386. doi: 10.21136/MB.1994.126117
@article{10_21136_MB_1994_126117,
author = {Ivan\v{c}o, Jaroslav},
title = {Note on independent sets of a graph},
journal = {Mathematica Bohemica},
pages = {385--386},
year = {1994},
volume = {119},
number = {4},
doi = {10.21136/MB.1994.126117},
mrnumber = {1316591},
zbl = {0812.05053},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.1994.126117/}
}