Search Results for ""

The (lower) irredundance number ir(G) of a graph G is the minimum size of a maximal irredundant set of vertices in G. The upper irredundance number is defined as the maximum ...

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

Tracing through the connections of a branchial graph gives rise to the notion of a kind of space in which states on different branches of history are laid out. In particular, ...

The pentakis icosidodecahedron is the dual of the chamfered dodecahedron. It contains 42 vertices, 120 edges, and 80 faces. The canonical version has two distinct edge ...

The equilateral triaugmented triangular prism is the Johnson solid J_(51) constructed by erecting a regular tetrahedron on each square face of an equilateral triangular ...

The Ramsey number R(m,n) gives the solution to the party problem, which asks the minimum number of guests R(m,n) that must be invited so that at least m will know each other ...

A maximal irredundant set is an irredundant set that cannot be expanded to another irredundant set by addition of any vertex in the graph. Note that a maximal irredundant set ...

A scale-free network is a connected graph or network with the property that the number of links k originating from a given node exhibits a power law distribution ...

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...