A polynomial time algorithm for geodetic hull number for complementary prisms

DOI10.1051/ITA/2022001MaRDI QIDQ5037202zbMATH OpenOpenAlexFDO

Authors Erika M. M. Coelho, Hebert Coelho, Julliano Rosa Nascimento, Jayme L. Szwarcfiter

Publication date 28 February 2022

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/ita/2022001

zbMATH Keywords

complementary prismsgeodetic convexityhull number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• On the geodetic hull number for complementary prisms. II.
• A note on the convexity number for complementary prisms
• On the hull number of some graph classes
• On the geodetic number of complementary prisms
• On the hull number of a graph.

Cites work

• A graph and its complement with specified properties. I: Connectivity
• Complement reducible graphs
• Complexity properties of complementary prisms
• Connected domination number of a graph and its complement
• Convexity in partial cubes: the hull number
• Four classes of perfectly orderable graphs
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• scientific article; zbMATH DE number 5066400 (Why is no real title available?)
• Hull number: \(P_5\)-free graphs and reduction rules
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• Local majorities, coalitions and monopolies in graphs: A review
• On the \(P_3\)-hull number of some products of graphs
• On the computation of the hull number of a graph
• On the geodetic hull number for complementary prisms. II.
• On the geodetic hull number of \(P_{k}\)-free graphs
• On the hull number of some graph classes
• Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs
• Recognizing some complementary products
• Remarks on k-clique, k-independent set and 2-contamination in complementary prisms
• Some parameters of graph and its complement
• The complementary product of two graphs
• The geodetic hull number is hard for chordal graphs
• The hull number of a graph
• The splittance of a graph

Cited in

(3)

• On the geodetic number of complementary prisms
• On the geodetic hull number for complementary prisms. II.
• A note on the convexity number for complementary prisms

This page was built for publication: A polynomial time algorithm for geodetic hull number for complementary prisms

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