A generalization of the friendship theorem
Marián Sudolský (1978)
Mathematica Slovaca
Similarity:
Marián Sudolský (1978)
Mathematica Slovaca
Similarity:
Ján Plesník (1977)
Mathematica Slovaca
Similarity:
Anton Kundrík (1990)
Mathematica Slovaca
Similarity:
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...
Punnim, Narong (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity: