Algebraic connectivity of graphs
Reads0
Chats0
About:
This article is published in Czechoslovak Mathematical Journal.The article was published on 1973-01-01 and is currently open access. It has received 3888 citations till now. The article focuses on the topics: Algebraic graph theory & Irreducible component.read more
Citations
More filters
Journal ArticleDOI
Strategic Power Infrastructure Defense
TL;DR: A new concept for bargaining by multiagents to identify the decision options to reduce the system vulnerability is included and the concept of a flexible configuration of the wide-area grid is substantiated with an area-partitioning algorithm.
Journal ArticleDOI
An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
TL;DR: In this paper, the authors present a survey of kernel-on-graphs (kernels on graphs) and two related similarity matrices, which they refer to as kernels on graph.
Journal ArticleDOI
Spectral conformal parameterization
TL;DR: A spectral approach to automatically and efficiently obtain discrete free‐boundary conformal parameterizations of triangle mesh patches, without the common artifacts due to positional constraints on vertices and without undue bias introduced by sampling irregularity is presented.
Journal ArticleDOI
Geometric Mesh Partitioning: Implementation and Experiments
TL;DR: A method of dividing an irregular mesh into equal-sized pieces with few interconnecting edges is investigated, based on theoretical work of Miller, Teng, Thurston, and Vavasis, who showed that certain classes of "well-shaped" finite-element meshes have good separators.
Book ChapterDOI
Eigenvalues in Combinatorial Optimization
Bojan Mohar,Svatopluk Poljak +1 more
TL;DR: In the last decade many important applications of eigenvalues and eigenvectors of graphs in combinatorial optimization were discovered.
References
More filters
Book ChapterDOI
Congruent Graphs and the Connectivity of Graphs
TL;DR: In this paper, the authors give conditions that two graphs be congruent and some theorems on the connectivity of graphs, and conclude with some applications to dual graphs, which can also be proved by topological methods.