Search Results for ""

Let d_G(k) be the number of dominating sets of size k in a graph G, then the domination polynomial D_G(x) of G in the variable x is defined as ...

There are several sorts of graphs referred to as "star graphs" in mathematics, computer science, and information processing. The most common sort of star is the n-star graph ...

Let G be a group, and let S subset= G be a set of group elements such that the identity element I not in S. The Cayley graph associated with (G,S) is then defined as the ...

Analytic continuation (sometimes called simply "continuation") provides a way of extending the domain over which a complex function is defined. The most common application is ...

The Barnette-Bosák-Lederberg graph is a graph on 38 vertices which is the smallest known example of a planar 3-connected nonhamiltonian graph, i.e., the smallest known ...

In most modern literature, a Boolean model is a probabilistic model of continuum percolation theory characterized by the existence of a stationary point process X and a ...

A graph is claw-free iff it does not contain the complete bipartite graph K_(1,3) (known as the "claw graph"; illustrated above) as a forbidden induced subgraph. The line ...

The folded n-cube graph, perhaps better termed "folded hypercube graph," is a graph obtained by merging vertices of the n-hypercube graph Q_n that are antipodal, i.e., lie at ...

The Grötzsch graph is smallest triangle-free graph with chromatic number four. It is identical to the Mycielski graph of order four, and is implemented as ...

The Klein graph is a weakly regular graph that is the dual graph of the cubic symmetric graph F_(056)B. The Klein graph is illustrated above in four order-4 LCF notations. ...