Search Results for ""

The (m,n)-windmill graph is the graph obtained by taking m copies of the complete graph K_n with a vertex in common (Gallian 2011, p. 16). The (m,n)-windmill graph is ...

"The" Y-graph is another term used to refer to a claw graph. The term "Y-graph" is also used to refer to a graph expansion with the Y graph as its base (e.g., Horton and ...

The ABC (atom-bond connectivity) energy of a graph is defined as the graph energy of its ABC matrix, i.e., the sum of the absolute values of the eigenvalues of its ABC matrix.

The ABC (atom-bond connectivity) index of a graph is defined as half the sum of the matrix elements of its ABC matrix. It was introduced by Estrada et al. (2017) to model the ...

A polynomial A_n(x;a) given by the associated Sheffer sequence with f(t)=te^(at), (1) given by A_n(x;a)=x(x-an)^(n-1). (2) The generating function is ...

The set E of edges of a loopless graph (V,E), being a set of unordered pairs of elements of V, constitutes an adjacency relation on V. Formally, an adjacency relation is any ...

In a graph G, two graph vertices are adjacent if they are joined by a graph edge.

The use of techniques from algebra, topology, and geometry in the solution of combinatorial problems, or the use of combinatorial methods to attack problems in these areas ...

The determination of the number of alternating permutations having elements {1,2,...,n}.

1. A fixed polyomino. 2. The set of points obtained by taking the centers of a fixed polyomino.