- Tytuł:
- One-Three Join: A Graph Operation and Its Consequences
- Autorzy:
-
Shalu, M.A.
Devi Yamini, S. - Powiązania:
- https://bibliotekanauki.pl/articles/31341697.pdf
- Data publikacji:
- 2017-08-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
one-three join
bipartite-join
homogeneous set
odd hole-free graphs - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2017, 37, 3; 633-647
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł