Comparability Graphs Among Cover-Incomparability Graphs

Anil, Arun; Changat, Manoj

doi:10.1007/978-3-030-95018-7_5

Cited by 2 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is also interesting to note that every C-I graph has a Ptolemaic C-I graph as a spanning subgraph [4]. In a most recent paper, C-I graphs are studied among comparability graphs [2].…”

Section: Introductionmentioning

confidence: 99%

Composition and product of cover-incomparability graphs

Changat

Anil

2022

Art Discrete Appl. Math.

View full text Add to dashboard Cite

Cover-Incomparability graphs (C-I graphs) form an interesting class of graphs arising from posets. A few classes of graphs are known to be C-I graphs so far. Composition operation and various graph products are usually used to produce more non-trivial graphs in a particular graph class, using the prime graphs in the class. In this paper, we attempt to study the effect of the composition, lexicographic and strong products of C-I graphs. We found that the lexicographic product of two C-I graphs, say G and H is a C-I graph if and only if either G is any C-I graph, and H is a complete graph or vice versa. A similar result holds for the strong product also. It can be observed that the composition operation is more general than lexicographic product and we obtain new classes of C-I graphs from this operation.

show abstract

“…It is also interesting to note that every C-I graph has a Ptolemaic C-I graph as a spanning subgraph [4]. In a most recent paper, C-I graphs are studied among comparability graphs [2].…”

Section: Introductionmentioning

confidence: 99%

Composition and product of cover-incomparability graphs

Changat

Anil

2022

Art Discrete Appl. Math.

View full text Add to dashboard Cite

show abstract

“…It is also interesting to note that every C-I graph has a Ptolemaic C-I graph as a spanning subgraph [4]. C-I graphs are also studied among the comparability graphs [2]. The effect of composition operation, lexicographic, and strong products of C-I graphs was studied in a recent paper [1].…”

Section: Introductionmentioning

confidence: 99%

“…C-I graphs are also studied among the comparability graphs [2]. The effect of composition operation, lexicographic, and strong products of C-I graphs was studied in a recent paper [1].…”

Section: Introductionmentioning

confidence: 99%

“…1 and T is a path, it follows from the definition of a clique tree that v is not in any other cliques in T . Then by Lemma 7, v is a simplicial vertex.Based on Theorem 3 and Lemma 8 and 9, we formulate the following algorithm for recognizing a chordal C-I graph G. The correctness of the algorithm follows from these results.Algorithm Algorithm for recognizing given graph G is chordal C-I graph G or not.Input : G be a connected graph with |V (G)| = n and |E(G)| = m Output: G is chordal C-I graph or not…”

mentioning

confidence: 99%

See 1 more Smart Citation

Ptolemaic and Chordal Cover-Incomparability Graphs

Anil

Changat

2021

Order

View full text Add to dashboard Cite

Cover-Incomparability graphs (C-I graphs) are an interesting class of graphs from posets. A C-I graph is a graph from a poset P = (V, ≤) with vertex set V , and the edge-set is the union of edge sets of the cover graph and the incomparability graph of the poset. The recognition of the C-I graphs is known to be NP-complete (Maxová et al., Order 26(3), 229-236(2009)). In this paper, we prove that chordal graphs having at most two independent simplicial vertices are exactly the chordal graphs which are also C-I graphs. A similar result is obtained for cographs as well. Using the structural results of these graphs, we derive linear time recognition algorithms for chordal graphs and cographs, which are C-I graphs.

show abstract

Comparability Graphs Among Cover-Incomparability Graphs

Cited by 2 publications

References 13 publications

Composition and product of cover-incomparability graphs

Composition and product of cover-incomparability graphs

Ptolemaic and Chordal Cover-Incomparability Graphs

Contact Info

Product

Resources

About