Graphs with large geodetic number

DOI10.2298/FIL1506361AzbMath1464.05276OpenAlexW2133134555MaRDI QIDQ5278659

Lutz Volkmann, Saeed Kosari, Seyyed Mahmoud Sheikholeslami, Hossein Abdollahzadeh Ahangar

Publication date: 19 July 2017

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1506361a

zbMATH Keywords

geodetic numbergeodetic set

Mathematics Subject Classification ID

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

Related Items (12)

Strong geodetic number of complete bipartite graphs and of graphs with specified diameter ⋮ Strong geodetic problem on Cartesian products of graphs ⋮ THE GEODETIC FAULT TOLERANT DOMINATION NUMBER OF A GRAPH ⋮ Total restrained geodetic number of graphs ⋮ More on the outer connected geodetic number of a graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The forcing geodetic global domination number of a graph ⋮ Graphs with large total geodetic number ⋮ The geodetic hop domination number of complementary prisms ⋮ Distinct edge geodetic decomposition in graphs

This page was built for publication: Graphs with large geodetic number