Search Results for ""

Call a graph vertex m(a,b,c) a median of a graph G if it lies on all shortest paths between each pair of vertices (a,b), (b,a), and (c,a) in G. A median graph is then defined ...

A planted tree is a rooted tree whose root vertex has vertex degree 1. The number of planted trees of n nodes is T_(n-1), where T_(n-1) is the number of rooted trees of n-1 ...

A polar zonohedron is a convex zonohedron derived from the star which joins opposite vertices of any right n-gonal prism (for n even) or antiprism (for n odd). The faces of ...

A quasi-qunitic graph is a quasi-regular graph, i.e., a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 ...

Let a Cevian PC be drawn on a triangle DeltaABC, and denote the lengths m=PA^_ and n=PB^_, with c=m+n. Then Stewart's theorem, also called Apollonius' theorem, states that ...

A walk is a sequence v_0, e_1, v_1, ..., v_k of graph vertices v_i and graph edges e_i such that for 1<=i<=k, the edge e_i has endpoints v_(i-1) and v_i (West 2000, p. 20). ...

The Jordan matrix decomposition is the decomposition of a square matrix M into the form M=SJS^(-1), (1) where M and J are similar matrices, J is a matrix of Jordan canonical ...

A quasiregular polyhedron is the solid region interior to two dual regular polyhedra with Schläfli symbols {p,q} and {q,p}. Quasiregular polyhedra are denoted using a ...

A maximal independent set is an independent set which is a maximal set, i.e., an independent set that is not a subset of any other independent set. The generic term "maximal ...

A member of a collection of sets is said to be maximal if it cannot be expanded to another member by addition of any element. Maximal sets are important in graph theory since ...