Search Results for ""

The periphery of a graph G is the subgraph of G induced by vertices that have graph eccentricities equal to the graph diameter. The periphery of a connected graph may be ...

The n-pan graph is the graph obtained by joining a cycle graph C_n to a singleton graph K_1 with a bridge. The n-pan graph is therefore isomorphic with the (n,1)-tadpole ...

"The" H graph is the tree on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["HGraph"]. The term "H-graph" is also used to refer to a ...

A weighted graph is a graph in which each branch is given a numerical weight. A weighted graph is therefore a special type of labeled graph in which the labels are numbers ...

An octic graph is a regular graph of degree eight. The numbers of simple octic graphs on n=9, 10, 11, ... nodes are 1, 6, 94, 10786, 3459386, ... (OEIS A014378). Examples are ...

A graph that can be reduced to another graph with the same degree sequence by edge-switching is known as a switchable graph. Conversely, a graph that cannot be reduced to ...

The bull graph is a simple graph on 5 nodes and 5 edges whose name derives from its resemblance to a schematic illustration of a bull or ram (whose face is the triangle and ...

The energy of a graph is defined as the sum of the absolute values of its graph eigenvalues (i.e., the sum of its graph spectrum terms). Other varieties of graph energy are ...

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...

A sextic graph is a regular graph of degree six. The numbers of simple sextic graphs on n=7, 8, ... nodes are 1, 1, 4, 21, 266, 7846, 367860, ... (OEIS A006822). Examples are ...