نتایج جستجو برای: well-covered

تعداد نتایج: 1567040  

Journal: :The Chemical Record 2017

Journal: :Discrete Mathematics 2011
Jason I. Brown Richard Hoshino

A graph is well-covered if every independent set can be extended to a maximum independent set. We show that it is co-NP-complete to determine whether an arbitrary graph is well-covered, even when restricted to the family of circulant graphs. Despite the intractability of characterizing the complete set of well-covered circulant graphs, we apply the theory of independence polynomials to show tha...

Journal: :Discrete Mathematics 1994

Journal: :Discussiones Mathematicae Graph Theory 2023

The $k$-token graph $T_k(G)$ is the whose vertices are $k$-subsets of a $G$, with two adjacent if their symmetric difference an edge $G$. We explore when well-covered graph, that is, all its maximal independent sets have same cardinality. For bipartite graphs we classify well-covered. arbitrary show $T_2(G)$ well-covered, then girth $G$ at most four. include upper and lower bounds on independen...

Journal: :Discrete Mathematics 1982

Journal: :Discrete Mathematics 2011

Journal: :bulletin of the iranian mathematical society 0
h. haghighi k. n. toosi university of technology

‎in this paper we give a characterization of unmixed tripartite‎ ‎graphs under certain conditions which is a generalization of a‎ ‎result of villarreal on bipartite graphs‎. ‎for bipartite graphs two‎ ‎different characterizations were given by ravindra and villarreal‎. ‎we show that these two characterizations imply each other‎.

Journal: :Discrete Mathematics 1996
Ramesh S. Sankaranarayana Lorna Stewart

We give an alternative characterization for well-covered graphs and restrict this to a characterization for very well covered graphs. We state the conditions under which the intersection of a pair of maximal independent sets of a well-covered graph is maximal and use this result to deene and characterize two recursively decomposable sub-classes of well-covered graphs, one properly containing th...

Journal: :Discrete Applied Mathematics 2006
Bert Randerath Preben D. Vestergaard

A maximum independent set of vertices in a graph is a set of pairwise nonadjacent vertices of largest cardinality . Plummer [Some covering concepts in graphs, J. Combin. Theory 8 (1970) 91–98] defined a graph to be well-covered, if every independent set is contained in a maximum independent set of G. Every well-covered graph G without isolated vertices has a perfect [1, 2]-factor FG, i.e. a spa...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید