Geodesic
Eigenvalues and domination in graphs
Mathematica slovaca, Tome 46 (1996) no. 1, pp. 33-39
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C35, 05C50 
@article{MASLO_1996_46_1_a3,
     author = {Brand, Clemens and Seifter, Norbert},
     title = {Eigenvalues and domination in graphs},
     journal = {Mathematica slovaca},
     pages = {33--39},
     year = {1996},
     volume = {46},
     number = {1},
     mrnumber = {1414407},
     zbl = {0857.05072},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1996_46_1_a3/}
}
TY  - JOUR
AU  - Brand, Clemens
AU  - Seifter, Norbert
TI  - Eigenvalues and domination in graphs
JO  - Mathematica slovaca
PY  - 1996
SP  - 33
EP  - 39
VL  - 46
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/MASLO_1996_46_1_a3/
LA  - en
ID  - MASLO_1996_46_1_a3
ER  - 
%0 Journal Article
%A Brand, Clemens
%A Seifter, Norbert
%T Eigenvalues and domination in graphs
%J Mathematica slovaca
%D 1996
%P 33-39
%V 46
%N 1
%U http://geodesic.mathdoc.fr/item/MASLO_1996_46_1_a3/
%G en
%F MASLO_1996_46_1_a3
Brand, Clemens; Seifter, Norbert. Eigenvalues and domination in graphs. Mathematica slovaca, Tome 46 (1996) no. 1, pp. 33-39. http://geodesic.mathdoc.fr/item/MASLO_1996_46_1_a3/

[1] ANDERSON W. N., MORLEY T. D.: Eigenvalues of the Laplacian of a graph. Linear and Multilinear Algebra 18 (1985), 141-145. | MR | Zbl

[2] FIEDLER M.: Algebraic connectivity in graphs. Czechoslovak Math. J. 23(98) (1973). 298-305. | MR

[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. | MR | Zbl

[4] MOHAR B., POLJAK S.: Eigenvalues in combinatorial optimization. Preprint 1992. | MR

[5] POTHEN A., SIMON H. D., LIOU K.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11 (1990), 430-452. | MR | Zbl

[6] SIMON H. D.: Partitioning of unstructured problems for parallel processing. Computing Sys. Eng. 2 (1991), 135-148.