Finding a minimum dominating set by transforming domination of vertices.
Saoud, Mahmoud, Jebran, Jebran (2009)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Saoud, Mahmoud, Jebran, Jebran (2009)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Milica Stojanović (2005)
Matematički Vesnik
Similarity:
Lawrencenko, Serge, Negami, Seiya, Sabitov, Idjad Kh. (2002)
Beiträge zur Algebra und Geometrie
Similarity:
Ling, Joseph M. (2004)
Beiträge zur Algebra und Geometrie
Similarity:
Fijavž, Gašper, Wood, David R. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
B. Borovićanin, I. Gutman, M. Petrović (2002)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Ivan Gutman (2007)
The Teaching of Mathematics
Similarity:
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, , Andreev’s Theorem provides five classes of linear inequalities, depending on , for the dihedral angles, which are necessary and sufficient conditions for the existence of a hyperbolic polyhedron realizing with the assigned dihedral angles. Andreev’s Theorem also shows that...
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....
Datta, Basudeb (2005)
Beiträge zur Algebra und Geometrie
Similarity: