Maximum nontrivial convex cover number of join and corona of graphs

MaRDI QIDQ5075976zbMATH OpenFDO

Authors Radu Buzatu

Publication date 12 May 2022

Full work available at URL http://www.math.md/publications/basm/issues/y2021-n1-2/13364/

zbMATH Keywords

convex covercorona of graphsjoin of graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On nontrivial covers and partitions of graphs by convex sets
• Convex sets under some graph operations
• Convex sets in the corona and conjunction of graphs
• The convexity number of a graph
• On the computational complexity of optimization convex covering problems of graphs

Cites work

• Binary linear programming approach to graph convex covering problems
• Convex graph covers
• Convex sets in the corona and conjunction of graphs
• Convex sets under some graph operations
• scientific article; zbMATH DE number 3838821 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 975414 (Why is no real title available?)
• Nontrivial convex covers of trees
• On nontrivial covers and partitions of graphs by convex sets
• On the computational complexity of optimization convex covering problems of graphs

This page was built for publication: Maximum nontrivial convex cover number of join and corona of graphs

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