This paper describes a new approach to the problem of generating the class of all geodetic graphs homeomorphic to a given geodetic one. An algorithmic procedure is elaborated to carry out a systematic finding of such a class of graphs. As a result, the enumeration of the class of geodetic graphs homeomorphic to certain Moore graphs has been performed.
The Closed Geodetic Game: algorithms and strategies
Université Clermont Auvergne(克莱蒙奥弗涅大学);CNRS(法国国家科学研究中心);Mines de Saint-Étienne(圣艾蒂安国立高等矿业学校);Clermont-Auvergne-INP(克莱蒙奥弗涅理工学院);LIMOS(极限与优化实验室);INRAE(法国国家农业、食品和环境研究所);Laboratoire G-SCOP(G-SCOP实验室);CNRS, Univ. Grenoble Alpes(法国国家科学研究中心,格勒诺布尔阿尔卑斯大学);Ben-Gurion University of the Negev(内盖夫本古里安大学);Indian Institute of Technology Dharwad(印度理工学院达瓦德分校);Polytechnic University (Kyaing Tong)(桂开工科大学)
Algorithms and complexity for geodetic sets on interval and chordal graphs
University of Leeds(利兹大学);Indian Statistical Institute(印度统计研究所);Université Clermont Auvergne(克莱蒙奥弗涅大学);Grenoble-INP(格勒诺布尔国立理工学院);Ben-Gurion University of the Negev(内盖夫本-古里安大学);Indian Institute of Technology Delhi(德里印度理工学院);Univ. Bordeaux(波尔多大学)
Algorithms and complexity for geodetic sets on planar and chordal graphs
School of Computing, University of Leeds(利兹大学计算学院);Ben-Gurion University of the Negev(内盖夫本古里安大学);Indian Institute of Technology, Kharagpur(印度理工学院卡拉格普尔分校)
Algorithms and Hardness for Geodetic Set on Tree-like Digraphs
Université Clermont Auvergne, CNRS, Clermont Auvergne INP, Mines Saint-Étienne, LIMOS(克莱蒙奥弗涅大学、法国国家科学研究中心、克莱蒙奥弗涅理工大学、圣艾蒂安国立高等矿业学校、信息与系统优化实验室);School of Mathematics, Statistics, and Computer Science, University of Tehran(德黑兰大学数学、统计与计算机科学学院);Indian Institute of Science Education and Research Pune(浦那科学教育与研究所)