Pages that link to "Item:Q2461517"
From MaRDI portal
The following pages link to The geodetic numbers of graphs and digraphs (Q2461517):
Displaying 23 items.
- The minumum geodetic communication overlap graphs (Q289353) (← links)
- On the geodetic number of permutation graphs (Q741406) (← links)
- On the geodetic number of median graphs (Q941326) (← links)
- The hull and geodetic numbers of orientations of graphs (Q1025467) (← links)
- Strong geodetic number of complete bipartite graphs and of graphs with specified diameter (Q1637098) (← links)
- Total restrained geodetic number of graphs (Q1696108) (← links)
- On the hardness of finding the geodetic number of a subcubic graph (Q1708262) (← links)
- On \(F\)-geodetic graphs (Q1813987) (← links)
- The geodetic number of an oriented graph (Q1971800) (← links)
- A graph arising in the geometry of numbers (Q2031989) (← links)
- The geodesic-transversal problem (Q2246468) (← links)
- On the Carathéodory and exchange numbers of geodetic convexity in graphs (Q2283030) (← links)
- On the geodetic number of a graph (Q2782725) (← links)
- The total geodetic number of a graph (Q2831591) (← links)
- On the geodomatic number of a graph (Q2906267) (← links)
- Geodesic graphs. (Q2918610) (← links)
- (Q3615800) (← links)
- (Q3990579) (← links)
- Strong geodetic problem on Cartesian products of graphs (Q4579894) (← links)
- (Q5106187) (← links)
- Analogies between the geodetic number and the Steiner number of some classes of graphs (Q5278703) (← links)
- Computational and structural aspects of the geodetic and the hull numbers of shadow graphs (Q5918774) (← links)
- COMBINATORIAL APPROACH FOR COUNTING GEODETIC SETS WITH SUBDOMINATING NEIGHBORHOOD SYSTEMS (Q6170275) (← links)
