Search Results for ""

An outerplanar graph is a graph that can be embedded in the plane such that all vertices lie on the outer face. Outerplanar graphs are planar and, by their definition, ...

A prime-distance graph is a distance graph with distance set given by the set of prime numbers.

A pseudograph is a non-simple graph in which both graph loops and multiple edges are permitted (Zwillinger 2003, p. 220).

A quintic symmetric graph is a quintic graph (i.e., regular of degree 5) that is also symmetric. Since quintic graphs exist only on an even number of nodes, so do symmetric ...

The Randić energy of a graph is defined as the graph energy of its Randić matrix, i.e., the sum of the absolute values of the eigenvalues of its Randić matrix.

The Sombor energy of a graph is defined as the graph energy of its Sombor matrix, i.e., the sum of the absolute values of the eigenvalues of its Sombor matrix.

A Taylor graph is a distance-regular graph with intersection array {k,mu,1;1,mu,k}. A Taylor graph with these parameters has 2(k+1) vertices. The crown graphs K_2 square ...

A graph is said to be unswitchable if it cannot be reduced to another graph with the same degree sequence by edge-switching. Conversely, a graph that can be reduced to ...

The Van Lint-Schrijver Graph graph is a weakly regular Hamiltonian graph on 162 vertices with parameters (nu,k,lambda,mu)=(162,(6),(0),(0,1)). It is distance-regular with ...

A fan graph F_(m,n) is defined as the graph join K^__m+P_n, where K^__m is the empty graph on m nodes and P_n is the path graph on n nodes. The case m=1 corresponds to the ...