Clique irreducibility of some iterative classes of graphs

DOI10.7151/DMGT.1407MaRDI QIDQ3606456zbMATH OpenOpenAlexFDO

Authors Aparna Lakshmanan S., A. Vijayakumar

Publication date 26 February 2009

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL http://dyuthi.cusat.ac.in/purl/615

zbMATH Keywords

anti-Gallai graphsclique irreducible graphsclique vertex irreducible graphsGallai graphsline graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Clique irreducibility and clique vertex irreducibility of graphs
• scientific article; zbMATH DE number 22656
• On line graphs which are weakly maximal clique irreducible.
• scientific article; zbMATH DE number 5722250
• Weakly clique irreducibility of NEPS of two graphs

Cited in

(8)

• Convergence of iterated clique graphs
• Weakly clique irreducibility of NEPS of two graphs
• scientific article; zbMATH DE number 5722250 (Why is no real title available?)
• Clique irreducibility and clique vertex irreducibility of graphs
• scientific article; zbMATH DE number 22656 (Why is no real title available?)
• A survey of the studies on Gallai and anti-Gallai graphs
• EULERIAN AND HAMILTONIAN PROPERTIES OF GALLAI AND ANTI-GALLAI TOTAL GRAPHS
• Irreducible graphs

This page was built for publication: Clique irreducibility of some iterative classes of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3606456)