Abstract

Clique-gated graphs form an extension of quasi-median graphs. Two characterizations of these graphs are given and some other structural properties are obtained. An O( nm) algorithm is presented which recognizes clique-gated graphs. Here n and m denote the numbers of vertices and edges of a given graph, respectively.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call