Search Results for ""

The shortest path-spanning tree from a graph vertex of a graph.

A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...

A tree G^' whose graph vertices and graph edges form subsets of the graph vertices and graph edges of a given tree G.

The Hadwiger number of a graph G, variously denoted eta(G) (Zelinka 1976, Ivančo 1988) or h(G) (Stiebitz 1990), is the number of vertices in the largest complete minor of G ...

The detour matrix Delta, sometimes also called the maximum path matrix or maximal topological distances matrix, of a graph is a symmetric matrix whose (i,j)th entry is the ...

A path gamma is a continuous mapping gamma:[a,b]|->C^0, where gamma(a) is the initial point, gamma(b) is the final point, and C^0 denotes the space of continuous functions. ...

The minimum leaf number ml(G) of a connected graph G is the smallest number of tree leaves in any of its spanning trees. (The corresponding largest number of leaves is known ...

Let G be a planar graph whose vertices have been properly colored and suppose v in V(G) is colored C_1. Define the C_1C_2-Kempe chain containing v to be the maximal connected ...

Connecting the centers of touching spheres in a three-dimensional Apollonian gasket by edges given a graph known as the Apollonian network. This process is illustrated above ...

Bonato et al. (2014, 2015) defined the burning number of a simple graph as follows. Consider a process called burning involving are discrete time steps. Each node is either ...