Graph Operations Preserving W2-Property

Vadim E. Levit; Eugen Mandrescu

doi:10.1016/j.endm.2018.06.007

Graph Operations Preserving W₂-Property

Vadim E. Levit, Eugen Mandrescu

Research output: Contribution to journal › Article › peer-review

Abstract

A graph is well-covered if all its maximal independent sets are of the same size (Plummer, 1970). A graph G belongs to class W_n if every n pairwise disjoint independent sets in G are included in n pairwise disjoint maximum independent sets (Staples, 1975). Clearly, W₁ is the family of all well-covered graphs. Staples showed a number of ways to build graphs in W_n, using graphs from W_n or W_n+1. In this paper, we construct some more infinite subfamilies of the class W₂ by means of corona, join, and rooted product of graphs.

Original language	English
Pages (from-to)	35-40
Number of pages	6
Journal	Electronic Notes in Discrete Mathematics
Volume	68
DOIs	https://doi.org/10.1016/j.endm.2018.06.007
State	Published - Jul 2018
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2018 Elsevier B.V.

Keywords

class W
corona of graphs
graph join
independent set
rooted product of graphs
shedding vertex
well-covered graph

Access to Document

10.1016/j.endm.2018.06.007

Cite this

@article{6116706e739d414f94435aadc9d534bf,

title = "Graph Operations Preserving W2-Property",

abstract = "A graph is well-covered if all its maximal independent sets are of the same size (Plummer, 1970). A graph G belongs to class Wn if every n pairwise disjoint independent sets in G are included in n pairwise disjoint maximum independent sets (Staples, 1975). Clearly, W1 is the family of all well-covered graphs. Staples showed a number of ways to build graphs in Wn, using graphs from Wn or Wn+1. In this paper, we construct some more infinite subfamilies of the class W2 by means of corona, join, and rooted product of graphs.",

keywords = "class W, corona of graphs, graph join, independent set, rooted product of graphs, shedding vertex, well-covered graph",

author = "Levit, {Vadim E.} and Eugen Mandrescu",

note = "Publisher Copyright: {\textcopyright} 2018 Elsevier B.V.",

year = "2018",

month = jul,

doi = "10.1016/j.endm.2018.06.007",

language = "אנגלית",

volume = "68",

pages = "35--40",

journal = "Electronic Notes in Discrete Mathematics",

issn = "1571-0653",

publisher = "Elsevier",

}

TY - JOUR

T1 - Graph Operations Preserving W2-Property

AU - Levit, Vadim E.

AU - Mandrescu, Eugen

PY - 2018/7

Y1 - 2018/7

N2 - A graph is well-covered if all its maximal independent sets are of the same size (Plummer, 1970). A graph G belongs to class Wn if every n pairwise disjoint independent sets in G are included in n pairwise disjoint maximum independent sets (Staples, 1975). Clearly, W1 is the family of all well-covered graphs. Staples showed a number of ways to build graphs in Wn, using graphs from Wn or Wn+1. In this paper, we construct some more infinite subfamilies of the class W2 by means of corona, join, and rooted product of graphs.

AB - A graph is well-covered if all its maximal independent sets are of the same size (Plummer, 1970). A graph G belongs to class Wn if every n pairwise disjoint independent sets in G are included in n pairwise disjoint maximum independent sets (Staples, 1975). Clearly, W1 is the family of all well-covered graphs. Staples showed a number of ways to build graphs in Wn, using graphs from Wn or Wn+1. In this paper, we construct some more infinite subfamilies of the class W2 by means of corona, join, and rooted product of graphs.

KW - class W

KW - corona of graphs

KW - graph join

KW - independent set

KW - rooted product of graphs

KW - shedding vertex

KW - well-covered graph

UR - http://www.scopus.com/inward/record.url?scp=85049905074&partnerID=8YFLogxK

U2 - 10.1016/j.endm.2018.06.007

DO - 10.1016/j.endm.2018.06.007

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85049905074

SN - 1571-0653

VL - 68

SP - 35

EP - 40

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

ER -