scientific article; zbMATH DE number 1933222

zbMath1027.05033MaRDI QIDQ4405757

Gary Chartrand, Ping Zhang, Edgar M. Palmer

Publication date: 7 January 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (19)

The upper open monophonic number of a graph ⋮ The near geodetic number of a graph ⋮ On the toll number of a graph ⋮ Computing the hull and interval numbers in the weakly toll convexity ⋮ Partially balanced incomplete block (PBIB)-designs associated with geodetic sets in graphs ⋮ Toll number of the strong product of graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Some remarks on the geodetic number of a graph ⋮ On the remoteness function in median graphs ⋮ Unnamed Item ⋮ Toll number of the Cartesian and the lexicographic product of graphs ⋮ The geodetic number of the lexicographic product of graphs ⋮ The forcing near geodetic number of a graph ⋮ The forcing open monophonic number of a graph ⋮ The upper connected geodetic number and forcing connected geodetic number of a graph ⋮ Further results on the outer connected geodetic number of a graph ⋮ Steiner intervals, geodesic intervals, and betweenness ⋮ The edge-to-edge geodetic domination number of a graph

This page was built for publication: