Search Results for ""

Cospectral graphs, also called isospectral graphs, are graphs that share the same graph spectrum. The smallest pair of isospectral graphs is the graph union C_4 union K_1 and ...

A nonhamiltonian graph is a graph that is not Hamiltonian. All disconnected graphs are therefore nonhamiltoinian, as are acylic graphs. Classes of connected graphs that are ...

The ABC (atom-bond connectivity) spectral radius rho_(ABC) of a graph is defined as the largest eigenvalue of its ABC matrix. Chen (2019) showed that for a tree on 3 or more ...

A bridged graph is a graph that contains one or more graph bridges. Examples of bridged graphs include path graphs, ladder rung graphs, the bull graph, star graphs, and ...

The ophiuride is a cubic curve (left figure) given by the implicit equation x(x^2+y^2)+(ax-by)y=0, (1) where a>0,b>=0, or by the polar equation ...

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 ...

The Riemann sphere, also called the extended complex plane, is a one-dimensional complex manifold C^* (C-star) which is the one-point compactification of the complex numbers ...

A symbol of the form {p,q,r,...} used to describe regular polygons, polyhedra, and their higher-dimensional counterparts. The symbol {p} denotes a regular polygon for integer ...

An (n,k)-banana tree, as defined by Chen et al. (1997), is a graph obtained by connecting one leaf of each of n copies of an k-star graph with a single root vertex that is ...

The m-book graph is defined as the graph Cartesian product B_m=S_(m+1) square P_2, where S_m is a star graph and P_2 is the path graph on two nodes. The generalization of the ...