One-Three Join: A Graph Operation and Its Consequences

• Autorzy: M.A. Shalu , S. Devi Yamini
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

one-three join; bipartite-join; homogeneous set; odd hole-free graphs

Kategorie tematyczne

• 05C75: Structural characterization of families of graphs
• 05C76: Graph operations (line graphs, products, etc.)

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 37
• Numer: 3
• Strony: 633-647

Daty

wydano

2017-08-01

otrzymano

2015-09-29

poprawiono

2016-06-02

zaakceptowano

2016-06-02

online

2017-07-06

Twórcy

autor

M.A. Shalu

• , Kancheepuram, -,

autor

S. Devi Yamini

• , Kancheepuram, -,

Identyfikatory

DOI

10.7151/dmgt.1948