Displaying similar documents to “Triangulations of some cases of polyhedra with a small number of tetrahedra”

Tetracyclic harmonic graphs

B. Borovićanin, I. Gutman, M. Petrović (2002)

Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques

Similarity:

Andreev’s Theorem on hyperbolic polyhedra

Roland K.W. Roeder, John H. Hubbard, William D. Dunbar (2007)

Annales de l’institut Fourier

Similarity:

In 1970, E.M.Andreev published a classification of all three-dimensional compact hyperbolic polyhedra (other than tetrahedra) having non-obtuse dihedral angles. Given a combinatorial description of a polyhedron,  C , Andreev’s Theorem provides five classes of linear inequalities, depending on  C , for the dihedral angles, which are necessary and sufficient conditions for the existence of a hyperbolic polyhedron realizing C with the assigned dihedral angles. Andreev’s Theorem also shows that...

The maximum multiplicity and the two largest multiplicities of eigenvalues in a Hermitian matrix whose graph is a tree

Rosário Fernandes (2015)

Special Matrices

Similarity:

The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree, M1, was understood fully (froma combinatorial perspective) by C.R. Johnson, A. Leal-Duarte (Linear Algebra and Multilinear Algebra 46 (1999) 139-144). Among the possible multiplicity lists for the eigenvalues of Hermitian matrices whose graph is a tree, we focus upon M2, the maximum value of the sum of the two largest multiplicities when the largest multiplicity is M1. Upper and lower bounds are given for M2....