Symmetries of Alternating Cycle Matrices
Paulus Gerdes (2006)
Visual Mathematics
Similarity:
Paulus Gerdes (2006)
Visual Mathematics
Similarity:
Francesco Barioli (1998)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Peter Flor (1969)
Compositio Mathematica
Similarity:
George Hutchinson (2016)
Special Matrices
Similarity:
We disprove a conjecture made by Rajesh Pereira and Joanna Boneng regarding the upper bound on the number of doubly quasi-stochastic scalings of an n × n positive definite matrix. In doing so, we arrive at the true upper bound for 3 × 3 real matrices, and demonstrate that there is no such bound when n ≥ 4.
Wang, Jonathan (2010)
The Electronic Journal of Combinatorics [electronic only]
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...
Loewy, Raphael (1985-1986)
Portugaliae mathematica
Similarity:
Maciej Sysło (1982)
Banach Center Publications
Similarity: