On the geodetic rank of a graph

DOI10.4310/JOC.2017.V8.N2.A5MaRDI QIDQ2364865zbMATH OpenFDO

Authors Mamadou Moustapha Kanté, Rudini M. Sampaio, Vinícius F. dos Santos, Jayme L. Szwarcfiter

Publication date 25 July 2017

Published in Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4310/JOC.2017.V8.N2.A5

zbMATH Keywords

\(P^\ast_3\)-convexity\(P_3\)-convexitybipartite graphsgeodetic convexityinapproximabilitymonophonic convexityNP-completenessrank

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Complexity aspects of the computation of the rank of a graph
• scientific article; zbMATH DE number 5531985
• On the convexity number of graphs
• On the monophonic rank of a graph
• On the hull number of some graph classes

Cited in

(11)

• On the geodetic Radon number of grids
• On general position sets in Cartesian products
• The general position problem on Kneser graphs and on some graph operations
• The general position number of Cartesian products involving a factor with small diameter
• The general position problem and strong resolving graphs
• Characterization of general position sets and its applications to cographs and bipartite graphs
• Inapproximability results and bounds for the Helly and Radon numbers of a graph
• On the monophonic rank of a graph
• The iteration time and the general position number in graph convexities
• On the hull and interval numbers of oriented graphs
• On the rank and the general position number in cycle convexity

This page was built for publication: On the geodetic rank of a graph

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