Note on independent sets of a graph

Ivančo, Jaroslav. "Note on independent sets of a graph." Mathematica Bohemica 119.4 (1994): 385-386. <http://eudml.org/doc/29271>.

@article{Ivančo1994,
abstract = {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$.},
author = {Ivančo, Jaroslav},
journal = {Mathematica Bohemica},
keywords = {independent sets; circuit; independent sets; circuit},
language = {eng},
number = {4},
pages = {385-386},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Note on independent sets of a graph},
url = {http://eudml.org/doc/29271},
volume = {119},
year = {1994},
}

TY - JOUR
AU - Ivančo, Jaroslav
TI - Note on independent sets of a graph
JO - Mathematica Bohemica
PY - 1994
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 119
IS - 4
SP - 385
EP - 386
AB - 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$.
LA - eng
KW - independent sets; circuit; independent sets; circuit
UR - http://eudml.org/doc/29271
ER -