Search Results for ""

Let I(G) denote the set of all independent sets of vertices of a graph G, and let I(G,u) denote the independent sets of G that contain the vertex u. A fractional coloring of ...

Ore (1962) noted that not only does a tree possesses a unique shortest path between any two vertices, but that there also exist also other connected graphs having the same ...

For an undirected graph, an unordered pair of nodes that specify a line joining these two nodes are said to form an edge. For a directed graph, the edge is an ordered pair of ...

"Vertex" is a synonym for a node of a graph, i.e., one of the points on which the graph is defined and which may be connected by graph edges. The terms "point," "junction," ...

The great icosidodecahedron, not to be confused with the great icosahedron or great icosicosidodecahedron, is the uniform polyhedron with Maeder index 54 (Maeder 1997), ...

A Hamiltonian walk on a connected graph is a closed walk of minimal length which visits every vertex of a graph (and may visit vertices and edges multiple times). For ...

An integral graph, not to be confused with an integral embedding of a graph, is defined as a graph whose graph spectrum consists entirely of integers. The notion was first ...

A graph G=(V,E) is an interval graph if it captures the intersection relation for some set of intervals on the real line. Formally, P is an interval graph provided that one ...

A tensor which has the same components in all rotated coordinate systems. All rank-0 tensors (scalars) are isotropic, but no rank-1 tensors (vectors) are. The unique rank-2 ...

A lattice-ordered set is a poset (L,<=) in which each two-element subset {a,b} has an infimum, denoted inf{a,b}, and a supremum, denoted sup{a,b}. There is a natural ...