Displaying similar documents to “Equitran: A computer program for analysis of a nondeterministic discrete dynamic system”

A remark on graph operators

Bohdan Zelinka (1999)

Mathematica Bohemica

Similarity:

A theorem is proved which implies affirmative answers to the problems of E. Prisner. One problem is whether there are cycles of the line graph operator L with period other than 1, the other whether there are cycles of the 4-edge graph operator ∇ 4 with period greater than 2. Then a similar theorem follows.

The i-chords of cycles and paths

Terry A. McKee (2012)

Discussiones Mathematicae Graph Theory

Similarity:

An i-chord of a cycle or path is an edge whose endpoints are a distance i ≥ 2 apart along the cycle or path. Motivated by many standard graph classes being describable by the existence of chords, we investigate what happens when i-chords are required for specific values of i. Results include the following: A graph is strongly chordal if and only if, for i ∈ {4,6}, every cycle C with |V(C)| ≥ i has an (i/2)-chord. A graph is a threshold graph if and only if, for i ∈ {4,5}, every path...