One-Three Join: A Graph Operation and Its Consequences

M.A. Shalu, and S. Devi Yamini. "One-Three Join: A Graph Operation and Its Consequences." Discussiones Mathematicae Graph Theory 37.3 (2017): 633-647. <http://eudml.org/doc/288368>.

@article{M2017,
abstract = {In this paper, we introduce a graph operation, namely one-three join. We show that the graph G admits a one-three join if and only if either G is one of the basic graphs (bipartite, complement of bipartite, split graph) or G admits a constrained homogeneous set or a bipartite-join or a join. Next, we define ℳH as the class of all graphs generated from the induced subgraphs of an odd hole-free graph H that contains an odd anti-hole as an induced subgraph by using one-three join and co-join recursively and show that the maximum independent set problem, the maximum clique problem, the minimum coloring problem, and the minimum clique cover problem can be solved efficiently for ℳH.},
author = {M.A. Shalu, S. Devi Yamini},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {one-three join; bipartite-join; homogeneous set; odd hole-free graphs},
language = {eng},
number = {3},
pages = {633-647},
title = {One-Three Join: A Graph Operation and Its Consequences},
url = {http://eudml.org/doc/288368},
volume = {37},
year = {2017},
}

TY - JOUR
AU - M.A. Shalu
AU - S. Devi Yamini
TI - One-Three Join: A Graph Operation and Its Consequences
JO - Discussiones Mathematicae Graph Theory
PY - 2017
VL - 37
IS - 3
SP - 633
EP - 647
AB - In this paper, we introduce a graph operation, namely one-three join. We show that the graph G admits a one-three join if and only if either G is one of the basic graphs (bipartite, complement of bipartite, split graph) or G admits a constrained homogeneous set or a bipartite-join or a join. Next, we define ℳH as the class of all graphs generated from the induced subgraphs of an odd hole-free graph H that contains an odd anti-hole as an induced subgraph by using one-three join and co-join recursively and show that the maximum independent set problem, the maximum clique problem, the minimum coloring problem, and the minimum clique cover problem can be solved efficiently for ℳH.
LA - eng
KW - one-three join; bipartite-join; homogeneous set; odd hole-free graphs
UR - http://eudml.org/doc/288368
ER -