Previous |  Up |  Next

Article

Title: Eigenvalues and domination in graphs (English)
Author: Brand, Clemens
Author: Seifter, Norbert
Language: English
Journal: Mathematica Slovaca
ISSN: 0139-9918
Volume: 46
Issue: 1
Year: 1996
Pages: 33-39
.
Category: math
.
MSC: 05C35
MSC: 05C50
idZBL: Zbl 0857.05072
idMR: MR1414407
.
Date available: 2009-09-25T11:12:20Z
Last updated: 2012-08-01
Stable URL: http://hdl.handle.net/10338.dmlcz/129475
.
Reference: [1] ANDERSON W. N., MORLEY T. D.: Eigenvalues of the Laplacian of a graph.Linear and Multilinear Algebra 18 (1985), 141-145. Zbl 0594.05046, MR 0817657
Reference: [2] FIEDLER M.: Algebraic connectivity in graphs.Czechoslovak Math. J. 23(98) (1973). 298-305. MR 0318007
Reference: [3] MOHAR B.: The Laplacian spectrum of graphs.In: Graph Theory, Combinatorics, and Applications (Y. Alavi et al., eds.), J. Wiley, New York, 1991, pp. 871-898. Zbl 0840.05059, MR 1170831
Reference: [4] MOHAR B., POLJAK S.: Eigenvalues in combinatorial optimization.Preprint 1992. MR 1240959
Reference: [5] POTHEN A., SIMON H. D., LIOU K.: Partitioning sparse matrices with eigenvectors of graphs.SIAM J. Matrix Anal. Appl. 11 (1990), 430-452. Zbl 0711.65034, MR 1054210
Reference: [6] SIMON H. D.: Partitioning of unstructured problems for parallel processing.Computing Sys. Eng. 2 (1991), 135-148.
.

Files

Files Size Format View
MathSlov_46-1996-1_4.pdf 596.2Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo