Vertex independence in graphs under some binary operations

MaRDI QIDQ3534436zbMATH OpenFDO

Authors Rolito G. Eballe, Emmeline M. Llido, Melona T. Nocete

Publication date 3 November 2008

zbMATH Keywords

lower boundsindependence numbercartesian productindependent sets of vertices

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• scientific article; zbMATH DE number 1109407
• Independence in direct-product graphs
• scientific article; zbMATH DE number 6116809
• On the independence graph of a graph
• scientific article; zbMATH DE number 38156

Cited in

(8)

• scientific article; zbMATH DE number 4112649 (Why is no real title available?)
• Vertex covering and independent number on difference graphs
• Algebraic independent numbers of certain types of simple graphs
• A new notion of vertex independence and rank for finite graphs
• Independence-preserving operations: effects in polynomial representations
• INDEPENDENT SEMITOTAL DOMINATION IN THE LEXICOGRAPHIC PRODUCT OF GRAPHS
• scientific article; zbMATH DE number 4142076 (Why is no real title available?)
• INDEPENDENT SEMITOTAL DOMINATION IN THE CORONA OF GRAPHS

This page was built for publication: Vertex independence in graphs under some binary operations

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