Weakly clique irreducibility of NEPS of two graphs

MaRDI QIDQ2870971zbMATH OpenFDO

Authors Aparna Lakshmanan S., Tao-Ming Wang, A. Vijayakumar

Publication date 21 January 2014

Published in Utilitas Mathematica (Search for Journal in Brave)

zbMATH Keywords

non-complete extended \(p\)-sum (NEPS)weakly clique irreducible graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• scientific article; zbMATH DE number 5722250
• Clique irreducibility and clique vertex irreducibility of graphs
• scientific article; zbMATH DE number 2077670
• Clique irreducibility of some iterative classes of graphs
• Weak saturation numbers of complete bipartite graphs in the clique
• Clique independence, domination and irredundance in graphs
• On line graphs which are weakly maximal clique irreducible.
• scientific article; zbMATH DE number 22656
• Irredundant and perfect neighborhood sets in graphs and claw-free graphs
• On some weakly bipartite graphs

Cited in

(5)

• scientific article; zbMATH DE number 5722250 (Why is no real title available?)
• On irreducibility and Helly properties of maximal cliques
• Clique irreducibility of some iterative classes of graphs
• Clique irreducibility and clique vertex irreducibility of graphs
• On line graphs which are weakly maximal clique irreducible.

This page was built for publication: Weakly clique irreducibility of NEPS of two graphs

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