#### Filter Results:

#### Publication Year

1989

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

An algebraic approach is proposed which can be used to solve different problems on fasci-agraphs and rotagraphs. A particular instance of this method computes the domination number of fasciagraphs and rotagraphs in O(logn) time, where n is the number of monographs of such a graph. Fasciagraphs and rotagraphs include complete grid graphs Pk 0 P, and graphs… (More)

- Janez Zerovnik
- 2000

An independent set with 108 vertices in the strong product of four 7-cycles (C7 2 C7 2 C7 2 C7) is given. This improves the best known lower bound for the Shannon capacity of the graph C7 which is the zero-error capacity of the corresponding noisy channel. The search was done by a computer program using the \simulated annealing" algorithm with a constant… (More)

Mixed connectivity is a generalization of vertex and edge connectivity. A graph is (p, 0)-connected, p > 0, if the graph remains connected after removal of any p − 1 vertices. A graph is (p, q)-connected, p ≥ 0, q > 0, if it remains connected after removal of any p vertices and any q − 1 edges. Cartesian graph bundles are graphs that generalize both… (More)