Search Results for ""

The clique graph of a given graph G is the graph intersection of the family of cliques of G. A graph G is a clique graph iff it contains a family F of complete subgraphs ...

The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a ...

The n-cycle complement graph C^__n is the graph complement of the cycle graph C_n. Cycle complement graphs are special cases of circulant graphs. The first few are ...

A polynomial Z_G(q,v) in two variables for abstract graphs. A graph with one graph vertex has Z=q. Adding a graph vertex not attached by any graph edges multiplies the Z by ...

The stacked book graph of order (m,n) is defined as the graph Cartesian product S_(m+1) square P_n, where S_m is a star graph and P_n is the path graph on n nodes. It is ...

An m-gonal n-cone graph, also called the n-point suspension of C_m or generalized wheel graph (Buckley and Harary 1988), is defined by the graph join C_m+K^__n, where C_m is ...

The graph product denoted G-H and defined by the adjacency relations (gadjg^') or (g=g^' and hadjh^'). The graph lexicographic product is also known as the graph composition ...

The radius of a graph is the minimum graph eccentricity of any graph vertex in a graph. A disconnected graph therefore has infinite radius (West 2000, p. 71). Graph radius is ...

The neighborhood graph of a given graph from a vertex v is the subgraph induced by the neighborhood of a graph from vertex v, most commonly including v itself. Such graphs ...

The word "graph" has (at least) two meanings in mathematics. In elementary mathematics, "graph" refers to a function graph or "graph of a function," i.e., a plot. In a ...