29 search results - page 3 / 6 » Upper domination and upper irredundance perfect graphs |
DM
2010
13 years 2 months ago
2010
An octagon quadrangle is the graph consisting of an 8-cycle (x1, x2, ..., x8) with two additional chords: the edges {x1, x4} and {x5, x8}. An octagon quadrangle system of order v ...
DM
2002
13 years 7 months ago
2002
A star forest of a graph G is a spanning subgraph of G in which each component is a star. The minimum number of edges required to guarantee that an arbitrary graph, or a bipartite...
ARSCOM
2006
13 years 7 months ago
2006
ABSTRACT. The Levi graph of a balanced incomplete block design is the bipartite graph whose vertices are the points and blocks of the design, with each block adjacent to those poin...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...
GC
2008
Springer
13 years 7 months ago
2008
Springer
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...