scientific article; zbMATH DE number 3417498
From MaRDI portal
Publication:5682350
zbMath0265.05119MaRDI QIDQ5682350
Publication date: 1973
Full work available at URL: https://eudml.org/doc/12723
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph theory (05C99)
Related Items
Laplacian energy of a graph, The spectra of some trees and bounds for the largest eigenvalue of any tree, On the spectra of certain rooted trees, Computing communities in complex networks using the Dirichlet processing Gaussian mixture model with spectral clustering, A lower bound for the algebraic connectivity of a graph in terms of the domination number, Complex systems: features, similarity and connectivity, Fixed points and stability in the two-network frustrated Kuramoto model, Modularity maximization using completely positive programming, Inverse Perron values and connectivity of a uniform hypergraph, Transportation in graphs and the admittance spectrum, Spectral estimates for infinite quantum graphs, Load balancing for the parallel adaptive solution of partial differential equations, An estimate for the nonstochastic eigenvalues of doubly stochastic matrices, The Laplacian spread of unicyclic graphs, Upper bounds on algebraic connectivity via convex optimization, Tight bounds on the algebraic connectivity of Bethe trees, On the spectra of some weighted rooted trees and applications, Lower bounds of the Laplacian spectrum of graphs based on diameter, The spectra of a graph obtained from copies of a generalized Bethe tree, Eigenvalues and expanders, On the algebraic connectivity of graphs as a function of genus, On the Laplacian spectral radius of trees with fixed diameter, A new upper bound for eigenvalues of the Laplacian matrix of a graph, The structure of trivalent graphs with minimal eigenvalue gap, Two improved algorithms for envelope and wavefront reduction, On trees with exactly one characteristic element, Spectral partitioning works: planar graphs and finite element meshes, Latent semantic analysis and Fiedler retrieval, Bounds on the (Laplacian) spectral radius of graphs, Old and new results on algebraic connectivity of graphs, Spectral bounds for the betweenness of a graph, Laplacian integral graphs in \(S(a, b)\), Spectra of graphs and fractal dimensions. I, The local density of triangle-free graphs, Triadic formal concept analysis and triclustering: searching for optimal patterns, Distributed tracking control of second-order multi-agent systems under measurement noises, Frequency-domain criteria for consensus in multiagent systems with nonlinear sector-shaped couplings, Distributed estimation of Laplacian eigenvalues via constrained consensus optimization problems, When local and global clustering of networks diverge, On Cheeger inequalities of a graph, Consensus in nonlinear stationary networks with identical agents, Graphs, networks, and linear unbiased estimates, Multiway spectral clustering: a margin-based perspective, Absolute algebraic connectivity of double brooms and trees, Perturbation of coupling matrices and its effect on the synchronizability in arrays of coupled chaotic systems, A note on limit points for algebraic connectivity, On graphs with algebraic connectivity equal to minimum edge density, On spectral integral variations of mixed graphs, Permanental polynomials of graphs, Expanding and forwarding parameters of product graphs, Equiarboreal graphs, Spectra of weighted generalized Bethe trees joined at the root, Ordering trees with nearly perfect matchings by algebraic connectivity, On edge singularity and eigenvectors of mixed graphs, On the geometry and Laplacian of a graph, Kernel methods in machine learning, Eigenvalues, diameter, and mean distance in graphs, The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs, The symbiotic relationship of combinatorics and matrix theory, Fast online graph clustering via Erdős-Rényi mixture, Spectra of generalized Bethe trees attached to a path, Computing tight upper bounds on the algebraic connectivity of certain graphs, Algebraic connectivity and degree sequences of trees, A survey of automated conjectures in spectral graph theory, Parallel adaptation of general three-dimensional hybrid meshes, Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality, A sharp upper bound on algebraic connectivity using domination number, Process flexibility: design, evaluation, and applications, Rendezvous of multiple mobile agents with preserved network connectivity, Input design for structured nonlinear system identification, Some necessary and sufficient conditions for second-order consensus in multi-agent dynamical systems, A new relaxation framework for quadratic assignment problems based on matrix splitting, Decentralized estimation and control of graph connectivity for mobile sensor networks, A tearing-based hybrid parallel sparse linear system solver, The algebraic connectivity of graphs under perturbation, A note on Fiedler vectors interpreted as graph realizations, A conjecture on the algebraic connectivity of connected graphs with fixed girth, The minimal Laplacian spectral radius of trees with a given diameter, Algebraic connectivity and doubly stochastic tree matrices, The Laplacian spectral radius of a graph under perturbation, Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces, A tearing-based hybrid parallel banded linear system solver, Distributed consensus in noncooperative inventory games, A spectral lower bound for the treewidth of a graph and its consequences, Laplacian spectrum of weakly quasi-threshold graphs, First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph, Spectral partitioning with multiple eigenvectors, Minimum cuts, girth and a spectral threshold, Spectra of copies of a generalized Bethe tree attached to any graph, The minimum Laplacian spread of unicyclic graphs, On the algebraic connectivity of some caterpillars: a sharp upper bound and a total ordering, Eigenvalues and edge-connectivity of regular graphs, Solution of flow problems using unstructured grids on distributed memory platforms, Lower bounds for the eigenvalues of Laplacian matrices, Spanning trees in regular graphs, Laplacian graph eigenvectors, Laplacian eigenvalues and the maximum cut problem, Compiling constraint satisfaction problems, Laplacian matrices of graphs: A survey, The spectrum of the Laplacian matrix of a balanced binary tree, Estimation of Laplacian spectra of direct and strong product graphs, Graph partitioning by correspondence analysis and taxicab correspondence analysis, On the sum of the Laplacian eigenvalues of a graph and Brouwer's conjecture, Extremizing first eigenvalue of 3-colored digraphs made with given blocks, Connectedness of users-items networks and recommender systems, Generalized modularity matrices, A limit theorem for scaled eigenvectors of random dot product graphs, Some results on the Laplacian spread of a graph, Spectral properties of unimodular lattice triangulations, Entropy and stability of phase synchronisation of oscillators on networks, Laplacian spectral characterization of some graph join, On the spectral gap of a quantum graph, On the number of spanning trees, the Laplacian eigenvalues, and the Laplacian Estrada index of subdivided-line graphs, On the construction of \(L\)-equienergetic graphs, Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs, On the Laplacian spectra of some variants of corona, Edge perturbation on graphs with clusters: adjacency, Laplacian and signless Laplacian eigenvalues, General Cheeger inequalities for \(p\)-Laplacians on graphs, Information theory perspective on network robustness, Bicyclic graphs with maximum sum of the two largest Laplacian eigenvalues, Asymptotic behavior of the number of Eulerian orientations of graphs, Adaptive exponential synchronization of coupled complex networks on general graphs, The smallest values of algebraic connectivity for unicyclic graphs, Graphs with given diameter maximizing the algebraic connectivity, Distributed leader-follower flocking control for multi-agent dynamical systems with time-varying velocities, Delay robustness in consensus problems, The influence of Miroslav Fiedler on spectral graph theory, Two Laplacians for the distance matrix of a graph, On reciprocal eigenvalue property of weighted trees, Nonpositive eigenvalues of the adjacency matrix and lower bounds for Laplacian eigenvalues, Distributed motion constraints for algebraic connectivity of robotic networks, Decentralized global connectivity maintenance for interconnected Lagrangian systems in the presence of data corruption, Energy, Laplacian energy of double graphs and new families of equienergetic graphs, A Cheeger-type inequality on simplicial complexes, Design of highly synchronizable and robust networks, Nordhaus-Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues, On the distance Laplacian spectra of graphs, Accelerating distributed average consensus by exploring the information of second-order neighbors, Iterative denoising, Laplacian matrices of product graphs: applications in structural mechanics, Bipartiteness and the least eigenvalue of signless Laplacian of graphs, Path Laplacian matrices: introduction and application to the analysis of consensus in networks, Graph spectra in computer science, Shaping bursting by electrical coupling and noise, Eigenvalues of certain weighted graphs joined at their roots having cliques at some levels, The algebraic connectivity of lollipop graphs, Dynamic normal forms and dynamic characteristic polynomial, Hearing the clusters of a graph: A distributed algorithm, An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification, On the Laplacian spectral ratio of connected graphs, Sparse direct factorizations through unassembled hyper-matrices, Graph clustering, Spectral clustering and the high-dimensional stochastic blockmodel, Decentralized observers with consensus filters for distributed discrete-time linear systems, Algebraic connectivity of connected graphs with fixed number of pendant vertices, Metric uniformization and spectral bounds for graphs, A greedy topology design to accelerate consensus in broadcast wireless sensor networks, Stochastic consensus seeking with communication delays, Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra, A novel symmetric skew-Hamiltonian isotropic Lanczos algorithm for spectral conformal parameterizations, Continuation methods for approximate large scale object sequencing, \texttt{PQser:} a Matlab package for spectral seriation, On the Laplacian eigenvalues of a graph and Laplacian energy, Laplacian spread of graphs: lower bounds and relations with invariant parameters, Core-satellite graphs: clustering, assortativity and spectral properties, On Laplacian spectra of parametric families of closely connected networks with application to cooperative control, Measuring the impact of MVC attack in large complex networks, Maximizing the least signless Laplacian eigenvalue of unicyclic graphs, Combinatorial and spectral properties of König-Egerváry graphs, Spectra, Euclidean representations and clusterings of hypergraphs, Laplace eigenvalues of graphs---a survey, The performance of an eigenvalue bound on the max-cut problem in some classes of graphs, Spectral conditions for some graphical properties, On hereditary properties of the class of graphs with convex quadratic stability number, Eigenvalues and diameter, On algebraic connectivity augmentation, Line graph of combinations of generalized Bethe trees: Eigenvalues and energy, Effective graph resistance, On Hadamard diagonalizable graphs, Line graph eigenvalues and line energy of caterpillars, On the Laplacian spectral radii of bipartite graphs, On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs, Bounds of Laplacian spectrum of graphs based on the domination number, Boundary defensive \(k\)-alliances in graphs, Spectra of generalized compositions of graphs and hierarchical networks, The minimum signless Laplacian spectral radius of graphs with given independence number, Conjectures on index and algebraic connectivity of graphs, Some results on the Laplacian spectrum, Low eigenvalues of Laplacian matrices of large random graphs, Computational modeling of tumor-induced angiogenesis, Network connectivity assessment and improvement through relay node deployment, Combinatorial optimization of special graphs for nodal ordering and graph partitioning, On the Fiedler vectors of graphs that arise from trees by Schur complementation of the Laplacian, Incremental spectral clustering by efficiently updating the eigen-system, On a conjecture of Brouwer involving the connectivity of strongly regular graphs, Clustering large datasets by merging \(K\)-means solutions, Heterogeneously coupled maps: hub dynamics and emergence across connectivity layers, \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators, A bound on the Laplacian spread which is tight for strongly regular graphs, On the sum of the two largest Laplacian eigenvalues of unicyclic graphs, Web document clustering using hyperlink structures, Graph Laplacians, nodal domains, and hyperplane arrangements, Augmenting the algebraic connectivity for certain families of graphs, On the multiplicity of Laplacian eigenvalues and Fiedler partitions, Solving the max-cut problem using eigenvalues, An efficient communications strategy for finite element methods on the Connection Machine CM-5 system, Parallel adaptive mesh refinement and redistribution on distributed memory computers, Laplacian spectra and spanning trees of threshold graphs, Dynamical systems associated with adjacency matrices, On the von Neumann entropy of a graph, On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint, Geometry of complex networks and topological centrality, Spectral and structural properties of random interdependent networks, The smallest values of algebraic connectivity for trees, On the second minimum algebraic connectivity of the graphs whose complements are trees, The geometry of spontaneous spiking in neuronal networks, On the consensus of homogeneous multi-agent systems with arbitrarily switching topology, Algebraic connectivity of an even uniform hypergraph, On the eigenvalues of weighted directed graphs, The complexity of translationally invariant spin chains with low local dimension, An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian, Nodal decompositions of graphs, H-eigenvalues of signless Laplacian tensor for an even uniform hypergraph, Proof of conjectures involving algebraic connectivity of graphs, Spectra of subdivision-vertex and subdivision-edge neighbourhood coronae, Separating populations with wide data: a spectral analysis, Exemplar-based low-rank matrix decomposition for data clustering, Synchronizability of networks of chaotic systems coupled via a graph with a prescribed degree sequence, Band-restricted diagonally dominant matrices: computational complexity and application, Heuristics for synthesizing robust networks with a diameter constraint, Fast consensus seeking on networks with antagonistic interactions, The least algebraic connectivity of graphs, Optimal grid drawings of complete multipartite graphs and an integer variant of the algebraic connectivity, Spectral clustering via sparse graph structure learning with application to proteomic signaling networks in cancer, On edge-rupture degree of graphs, On two conjectures of spectral graph theory, On generalized windmill graphs, New bounds for the signless Laplacian spread, Combinatorial Perron parameters for trees, Stable phase retrieval from locally stable and conditionally connected measurements, Random neighborhood graphs as models of fracture networks on rocks: structural and dynamical analysis, Robust consensus control for a class of multi-agent systems via distributed PID algorithm and weighted edge dynamics, Optimizing network robustness by edge rewiring: a general framework, Extremal problems on saturation for the family of $k$-edge-connected graphs, Computing the smallest eigenpairs of the graph Laplacian, Synchronization of Lur'e-type nonlinear systems in linear dynamical networks having fast convergence rate and large DC gain, Spectral radius and \(k\)-connectedness of a graph, Gaussian noise and the two-network frustrated Kuramoto model, Bi-Laplacians on graphs and networks, The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model, Proof of conjecture involving algebraic connectivity and average degree of graphs, Distributed parameter estimation in unreliable WSNs: quantized communication and asynchronous intermittent observation, Synchronization in networks with strongly delayed couplings, The second eigenvalue of some normal Cayley graphs of highly transitive groups, A tight upper bound on the spectral radius of bottleneck matrices for graphs, Largest eigenvalue of a unicyclic mixed graphs, A divide-and-conquer bound for aggregate's quality and algebraic connectivity, Laplacians on periodic graphs with guides, On sums of graph eigenvalues, Distributed consensus for discrete-time directed networks of multiagents with time-delays and random communication links, Spectral clustering with physical intuition on spring-mass dynamics, On algebraic connectivity and spectral integral variations of graphs, Synchronization of diffusively coupled systems on compact Riemannian manifolds in the presence of drift, Algebraic connectivity of interdependent networks, Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient, Uncovering the overlapping community structure of complex networks by maximal cliques, Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks, Asymptotic spectra of large (grid) graphs with a uniform local structure. I: Theory, Merging relative sensing networks: a stability margin perspective, Improving connectivity of compromised digital networks via algebraic connectivity maximisation, On the Laplacian spectra of token graphs, Regular graphs with minimum spectral gap, Tsypkin and Jury-Lee criteria for synchronization and stability of discrete-time multiagent systems, Sectorization and configuration transition in airspace design, On algebraic connectivity of directed scale-free networks, Kirchhoff index of simplicial networks, Spectral conditions for graph rigidity in the Euclidean plane, A note on Merris' conjectures, Convex programming based spectral clustering, Spectral threshold for extremal cyclic edge-connectivity, Optimality of spectral clustering in the Gaussian mixture model, Perron value and moment of rooted trees, Sampled-data-based fault-tolerant consensus control for multi-agent systems: a data privacy preserving scheme, Phase transition in spectral clustering based on resistance matrix, Spectral clustering revisited: information hidden in the Fiedler vector, Perron values and classes of trees, Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs, Delta invariant for Eulerian digraphs, Spectra of signed graphs, Community detection by resistance distance: automation and benchmark testing, \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs, Properties of spectra of graphs and line graphs, Structural importance and evolution: an application to financial transaction networks, A framework for distributed control via dynamic periodic event-triggering mechanisms, On trees with perfect matchings, The Laplacian eigenvalues of mixed graphs, The limit points of Laplacian spectra of graphs, On minimum algebraic connectivity of graphs whose complements are bicyclic, Critical parameters of the synchronisation's stability for coupled maps in regular graphs, Fisher information and synchronisation transitions: a case-study of a finite size multi-network Kuramoto-Sakaguchi system, Consensus dynamics on random rectangular graphs, On topological indices for small RNA graphs, Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems, Complementary eigenvalues of graphs, Spectral preorder and perturbations of discrete weighted graphs, A dynamical approach to efficient eigenvalue estimation in general multiagent networks, Laplacian spectrum of comaximal graph of the ring \(\mathbb{Z}_n\), Network cohesion, Multiway \(p\)-spectral graph cuts on Grassmann manifolds, Graph coarsening: from scientific computing to machine learning, A review on spectral clustering and stochastic block models, Matching number, Hamiltonian graphs and magnetic Laplacian matrices, On digraphs with polygonal restricted numerical range, On the \(s\)th Laplacian eigenvalue of trees of order \(st+1\), Trees with matrix weights: Laplacian matrix and characteristic-like vertices, Nonsingular mixed graphs with few eigenvalues greater than two, A new approach based on spectral graph theory to avoiding enclosed holes in topology optimization, Synchronization analysis of linear time-varying matrix-weighted coupled systems and its applications, Toughness and normalized Laplacian eigenvalues of graphs, Adaptive synchronization in the complex heterogeneous networks of Hindmarsh-Rose neurons, Regularity-based spectral clustering and mapping the Fiedler-carpet, Uniform convergence of local Fréchet regression with applications to locating extrema and time warping for metric space valued trajectories, The \(\ell^p\)-Gaussian-Grothendieck problem with vector spins, A survey of kernel and spectral methods for clustering, Tri-diagonal and penta-diagonal block matrices for efficient eigensolutions of problems in structural mechanics, Some properties of the eigenvalues of the net Laplacian matrix of a signed graph, Exploring the heterogeneity for node importance byvon Neumann entropy, A novel measure of edge and vertex centrality for assessing robustness in complex networks, Hidden symmetries in real and theoretical networks, Geometrically nonlinear analysis of circulant structures using an efficient eigensolution method, An upper bound on the algebraic connectivity of outerplanar graphs, Sign-changing diagonal perturbations of Laplacian matrices of graphs, Spectrally optimized pointset configurations, An analytic study of opinion dynamics in multi-agent systems, An anticipatory protocol to reach fast consensus in multi-agent systems, An estimate of the first non-zero eigenvalue of the Laplacian by the Ricci curvature on edges of graphs, The second largest eigenvalue and vertex-connectivity of regular multigraphs, A new proof for exact relationship between extra connectivity and extra diagnosability of regular connected graphs under MM* model, Distance geometry and data science, Algebraic connectivity and disjoint vertex subsets of graphs, Null decomposition of unicyclic graphs, The geometry connectivity of hypergraphs, Spectral properties of inverse sum indeg index of graphs, On synchronization in heterogeneous FitzHugh-Nagumo networks, Toughness in pseudo-random graphs, Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution, Connectivity and eigenvalues of graphs with given girth or clique number, Laplacian controllability for graphs obtained by some standard products, Measuring the stability of spectral clustering, Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number, Integer Laplacian eigenvalues of chordal graphs, \(Q\)-integral graphs with at most two vertices of degree greater than or equal to three, Diffusion bank networks and capital flows, A maximum algebraic connectivity increment edge-based strategy for capacity enhancement in scale-free networks, Phase transitions in normalized cut of social networks, Random evolution equations: well-posedness, asymptotics, and applications to graphs, On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\), On trees with algebraic connectivity greater than or equal to \(2(1-\cos(\frac{\pi}{7}))\), Hubs-biased resistance distances on graphs and networks, Adaptive synchronization in complex dynamical networks with coupling delays for general graphs, Ordering trees and graphs with few cycles by algebraic connectivity, Mean curvature, threshold dynamics, and phase field theory on finite graphs, A combinatorial Li-Yau inequality and rational points on curves, A scoring mechanism for the rank aggregation of network robustness, Maximizing algebraic connectivity for certain families of graphs, Bounds for different spreads of line and total graphs, Second-order consensus in multi-agent dynamical systems with sampled position data, Distributed finite-time estimation of the bounds on algebraic connectivity for directed graphs, Trees with a large Laplacian eigenvalue multiplicity, Decentralized local-global connectivity maintenance for networked robotic teams, Graphs with clusters perturbed by regular graphs -- \(A_\alpha \)-spectrum and applications, Cospectral pairs of regular graphs with different connectivity, Adaptive guaranteed-performance consensus control for multi-agent systems with an adjustable convergence speed, Continuous relaxations for the traveling salesman problem, An adaptive granulation algorithm for community detection based on improved label propagation, Matching extendability and connectivity of regular graphs from eigenvalues, `Hubs-repelling' Laplacian and related diffusion on graphs/networks, Cut ratios and Laplacian eigenvalues, Deterministic versus stochastic consensus dynamics on graphs, Nonpositive curvature is not coarsely universal, Spanning tree packing number and eigenvalues of graphs with given girth, Spectra of graphs resulting from various graph operations and products: a survey, The effects of structural perturbations on the synchronizability of diffusive networks, Block-indifference graphs: characterization, structural and spectral properties, Lower bounds for the least Laplacian eigenvalue of unbalanced blocks, Laplacian eigenvalues of the zero divisor graph of the ring \(\mathbb{Z}_n\), Laplacian spectra of power graphs of certain finite groups, Spectra of \((H_1, H_2)\)-merged subdivision graph of a graph, Consensus of second-order multi-agent systems under unknown but bounded measurement noises, Characterization of extremal graphs from Laplacian eigenvalues and the sum of powers of the Laplacian eigenvalues of graphs, The geometry of kernelized spectral clustering, Partitions of networks that are robust to vertex permutation dynamics, On some spectral properties of large block Laplacian random matrices, Vanishing of cohomology and property (T) for groups acting on weighted simplicial complexes, First eigenvalue of nonsingular mixed graphs with given number of pendant vertices, Addressing the envelope reduction of sparse matrices using a genetic programming system, Role of normalization in spectral clustering for stochastic blockmodels, Distributed control gains design for consensus in multi-agent systems with second-order nonlinear dynamics, Synchronization of coupled chaotic maps, On the bounds for signless Laplacian energy of a graph, Trace optimization and eigenproblems in dimension reduction methods, Exploitation of symmetry in graphs with applications to finite and boundary elements analysis, The Laplacian spread of graphs, Graphs with maximum Laplacian and signless Laplacian Estrada index, Unnamed Item, The algebraic connectivity of graphs with given circumference, Relating the extra connectivity and the conditional diagnosability of regular graphs under the comparison model, The algebraic connectivity of graphs with given matching number, Laplacian Spectra and Synchronization Processes on Complex Networks, Laplacian spectral bounds for clique and independence numbers of graphs, Structural Vulnerability and Robustness in Complex Networks: Different Approaches and Relationships Between them, Rotation gene set testing for longitudinal expression data, Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth, On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph, Complex networks: structure and dynamics, Algebraic connectivity of network-of-networks having a graph product structure, Connectivity-maintaining and collision-avoiding performance function approach for robust leader-follower formation control of multiple uncertain underactuated surface vessels, Practical output consensus of nonlinear heterogeneous multi-agent systems with limited data rate, Kemeny's constant and the effective graph resistance, Incremental Computation of Pseudo-Inverse of Laplacian, Some families of integral mixed graphs, Introduction to Complex Networks: Structure and Dynamics, On the full Brouwer's Laplacian spectrum conjecture, Schur reduction of trees and extremal entries of the Fiedler vector, Tighter spectral bounds for the cut size, based on Laplacian eigenvectors, A GPU-based preconditioned Newton-Krylov solver for flexible multibody dynamics, The seriation problem in the presence of a double Fiedler value, Spectral complexity of directed graphs and application to structural decomposition, Consistency of spectral clustering, Graphs of given order and size and minimum algebraic connectivity, Sharp spectral bounds for the vertex-connectivity of regular graphs, On the Laplacian spread of digraphs, Deleting vertices and interlacing Laplacian eigenvalues, Spectral Identification of Networks Using Sparse Measurements, Distributed estimation of algebraic connectivity of directed networks, On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs, A note on Fiedler value of classes with sublinear separators, On the Fiedler value of large planar graphs, Edge-connectivity and (signless) Laplacian eigenvalue of graphs, Spectra of combinatorial Laplace operators on simplicial complexes, Spectral conditions for connectivity, toughness and perfect \(k\)-matchings of regular graphs, Sharp spectral bounds for the edge-connectivity of regular graphs, On some general operators of hypergraphs, Lower bounds for the Estrada index using mixing time and Laplacian spectrum, Stochastic (in)stability of synchronisation of oscillators on networks, Some graphs determined by their (signless) Laplacian spectra, Approximating Spectral Clustering via Sampling: A Review, Parallel Hybrid Sparse Linear System Solvers, Spectral trisection of finite element models, Ordering trees with algebraic connectivity and diameter, The correlation of metrics in complex networks with applications in functional brain networks, A divisive spectral method for network community detection, Synchronizability of directed networks: The power of non-existent ties, Spectral clustering with eigenvector selection, The effect on the algebraic connectivity of a tree by grafting or collapsing of edges, The six classes of trees with the largest algebraic connectivity, Mean shift spectral clustering, Synchronization in random networks with given expected degree sequences, The ordering of trees and connected graphs by algebraic connectivity, The spectral radius of submatrices of Laplacian matrices for graphs with cut vertices, Doubly stochastic matrices of trees, Localized patterns in homogeneous networks of diffusively coupled reactors, Lower bounds of the Laplacian graph eigenvalues, Laplace spectra of orgraphs and their applications, Unnamed Item, Bounding the gap between extremal Laplacian eigenvalues of graphs, On partial contraction analysis for coupled nonlinear oscillators, Swarming behaviors in multi-agent systems with nonlinear dynamics, A novel nodal ordering algorithm for profile optimization by efficient solution of a differential equation, Decentralized control of vehicle formations, Comparison between Laplacian--energy--like invariant and Kirchhoff index, Force-based incremental algorithm for mining community structure in dynamic network, Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph, Some notes on the spectral perturbations of the signless Laplacian of a graph, Spectra, Energy and Laplacian Energy of Strong Double Graphs, Bounds on Laplacian eigenvalues related to total and signed domination of graphs, A hybrid artificial immune network for detecting communities in complex networks, Maximum algebraic connectivity augmentation is NP-hard, Criteria for global pinning-controllability of complex networks, Eigenvalues of the adjacency and Laplacian matrices for modified regular structural models, Local and global approaches of affinity propagation clustering for large scale data, PageRank Beyond the Web, TRACEMIN-Fiedler: A Parallel Algorithm for Computing the Fiedler Vector, The first two largest eigenvalues of Laplacian, spectral gap problem and Cheeger constant of graphs, Persistence of Network Synchronization under Nonidentical Coupling Functions, Synchronization of Heterogeneous Oscillators Under Network Modifications: Perturbation and Optimization of the Synchrony Alignment Function, On some properties of the Laplacian matrix revealed by the RCM algorithm, A sharp upper bound for the spectral radius of a nonnegative matrix and applications, A Fiedler-like theory for the perturbed Laplacian, Localization of dominant eigenpairs and planted communities by means of Frobenius inner products, Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs, Discrepancy and eigenvalues of Cayley graphs, Coordination of discrete-time multi-agent systems via relative output feedback, Maximizing the algebraic connectivity for a subclass of caterpillars, Algebraic connectivity on a subclass of caterpillars, The spectral radius of submatrices of Laplacian matrices for trees and its comparison to the Fiedler vector, Proximity in group inverses of M-matrices and inverses of diagonally dominant M-matrices, Multi-objective Optimization to Improve Robustness in Networks, Bounds for the least Laplacian eigenvalue of a signed graph, Shifted simplicial complexes are Laplacian integral, On relation between the Kirchhoff index and number of spanning trees of graph, Lexicographic polynomials of graphs and their spectra, Laplacian spread and some Hamiltonian properties of graphs, Constructions for type I trees with nonisomorphic Perron branches, Minimum algebraic connectivity of graphs whose complements are bicyclic with two cycles, Spectral Bounds for the Connectivity of Regular Graphs with Given Order, Distributed optimisation and control of graph Laplacian eigenvalues for robust consensus via an adaptive multilayer strategy, STUDY OF SOME GRAPHICAL PARAMETERS OF SOME GRAPH STRUCTURE, Rigidity of Random Subgraphs and Eigenvalues of Stiffness Matrices, Unnamed Item, Topology and graph products; eigenproblems in optimal structural analysis, Lower bounds for the algebraic connectivity of graphs with specified subgraphs, Laplacian integral graphs with a given degree sequence constraint, Resistance matrices of balanced directed graphs, Unnamed Item, On the bounds of Laplacian eigenvalues of k-connected graphs, Network Topology and Synchronization of Systems with Linear Time-Delayed Coupling, Unnamed Item, Rotor-angle versus voltage instability in the third-order model for synchronous generators, Cooperative visibility maintenance in SE(3) for multi-robot-networks with limited field-of-view sensors, Some graphs determined by their (signless) Laplacian spectra, Data Analytics on Graphs Part I: Graphs and Spectra on Graphs, Data Analytics on Graphs Part III: Machine Learning on Graphs, from Graph Topology to Applications, Unnamed Item, A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph, Symmetry-driven network reconstruction through pseudobalanced coloring optimization, Efficient and Reliable Overlay Networks for Decentralized Federated Learning, A rough-and-ready cluster-based approach for extracting finite-time coherent sets from sparse and incomplete trajectory data, The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning, Unnamed Item, CONSENSUS PROBLEMS IN WEIGHTED HIERARCHICAL GRAPHS, Spectra of Laplacian Matrices of Weighted Graphs: Structural Genericity Properties, Using Kronecker products to construct mimetic gradients, Combinatorial Perron values of trees and bottleneck matrices, Network Essence: PageRank Completion and Centrality-Conforming Markov Chains, Edge connectivity and the spectral gap of combinatorial and quantum graphs, Constrained Graph Partitioning via Matrix Differential Equations, Unnamed Item, Unnamed Item, Separating Populations with Wide Data: A Spectral Analysis, On the Ky Fan $k$-norm of the $LI$-matrix of graphs, Minimizing algebraic connectivity over graphs made with some given blocks, On the Structure of Isometrically Embeddable Metric Spaces, The Laplacian permanental polynomial for trees, The p-spectral radius of the Laplacian matrix, A new algorithm for domain decomposition of finite element models, Eigensolution of Laplacian matrices for graph partitioning and domain decomposition, Distance Laplacian eigenvalues and chromatic number in graphs, Unnamed Item, On a Conjecture on a Laplacian Matrix with Distinct Integral Spectrum, Cooperative control with distributed gain adaptation and connectivity estimation for directed networks, Polaritons and excitons: Hamiltonian design for enhanced coherence, Statistical inference on random dot product graphs: a survey, Nonlinear Consensus Algorithms with Uncertain Couplings, Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products, Unnamed Item, Automorphism group and category of cospectral graphs, Invertibility of graph translation and support of Laplacian Fiedler vectors, Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning, Products of graphs and Nordhaus-Gaddum type inequalities for eigenvalues, Construction of L-equienergetic graphs using some graph operations, Hamiltonian graphs of given order and minimum algebraic connectivity, On eigenvectors of mixed graphs with exactly one nonsingular cycle, Bounds on the subdominant eigenvalue involving group inverse with applications to graphs, On a bound on algebraic connectivity: the case of equality, On graphs with the largest Laplacian index, Random walks with long-range steps generated by functions of Laplacian matrices, From standard alpha-stable Lévy motions to horizontal visibility networks: dependence of multifractal and Laplacian spectrum, Generalized quasirandom properties of expanding graph sequences, Domination and Spectral Graph Theory, Signed and Minus Dominating Functions in Graphs, Human-Collaborative Schemes in the Motion Control of Single and Multiple Mobile Robots, Eigensolutions for factorable matrices of special patterns, Sherali-adams strikes back, Unnamed Item, Surgery principles for the spectral analysis of quantum graphs, State-dependent effective interactions in oscillator networks through coupling functions with dead zones, Multilevel Artificial Neural Network Training for Spatially Correlated Learning, Unnamed Item, Combined Hypothesis Testing on Graphs With Applications to Gene Set Enrichment Analysis, Unnamed Item, The permanent of the Laplacian matrix of a bipartite graph, Algebraic connectivity of k-connected graphs, On energy, Laplacian energy and p-fold graphs, Spectra of the extended neighborhood corona and extended corona of two graphs, Bounds for the Laplacian spectral radius of graphs, Consensus and synchronization problems on small-world networks, Unnamed Item, On the spectrum of linear dependence graph of a finite dimensional vector space, Unnamed Item, NEW UPPER BOUND ON THE LARGEST LAPLACIAN EIGENVALUE OF GRAPHS, Superdiffusion criteria on duplex networks, Laplacian spectra of Coprime Graph of finite cyclic and Dihedral groups, Fiedler vectors with unbalanced sign patterns, Recent developments on the power graph of finite groups – a survey, Parameters of connectivity in ()-linear graphs, Minimal extremal graphs for addition of algebraic connectivity and independence number of connected graphs, Combinatorial Algorithms for Minimizing the Maximum Laplacian and Signless Laplacian Eigenvalues of Weighted Graphs, Algebraic Connectivity Estimation Based on Decentralized Inverse Power Iteration, Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs, Hydrodynamic alignment with pressure II. Multi-species, Different central parts of trees and their pairwise distances, 2-connected graphs with the minimum algebraic connectivity, Symmetric Pascal matrices and related graphs, Symmetric matrices, signed graphs, and nodal domain theorems, On the \(d\)-dimensional algebraic connectivity of graphs, Classification of trees by Laplacian eigenvalue distribution and edge covering number, On singularity and properties of eigenvectors of complex Laplacian matrix of multidigraphs, Hearing shapes viap-adic Laplacians, Matrix functions in network analysis, Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition, Algebraic and combinatorial expansion in random simplicial complexes, Iterative solution of spatial network models by subspace decomposition, \(H_\infty\) consensus of multi-agent systems under hybrid cyber attacks via a sampled-data-based dynamic event-triggered resilient consensus protocol, On the Laplacian spectrum of \(k\)-symmetric graphs, On the spectra of token graphs of cycles and other graphs, Even order uniform hypergraph via the Einstein product, Quartic graphs with minimum spectral gap, Spectrum of Graphs over Rings: A Survey, Laplacian eigenvalues of the unit graph of the ring \(\mathbb{Z}_n\), Generalizing \(p\)-Laplacian: spectral hypergraph theory and a partitioning algorithm, Characterization of digraphs with three complementarity eigenvalues, Variable ansatz applied to spectral operator decomposition in a physical superconducting quantum device, On the cozero-divisor graphs associated to rings, Effects of adding arcs on the consensus convergence rate of leader-follower multi-agent systems, Scale fragilities in localized consensus dynamics, A Fenchel dual gradient method enabling regularization for nonsmooth distributed optimization over time-varying networks, Special \textit{LCD} codes from products of graphs, Spectral properties of token graphs, Combinatorial Fiedler theory and graph partition, A distributed block Chebyshev-Davidson algorithm for parallel spectral clustering, Universal Features for High-Dimensional Learning and Inference, An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs, Bifurcations in Nagumo equations on graphs and Fiedler vectors, Graph rigidity properties of Ramanujan graphs, The Normalized Laplacian Spectrum of Folded Hypercube with Applications, Nonsmooth control barrier function design of continuous constraints for network connectivity maintenance, Novel group decision making approach based on the rough soft approximations of graphs and hypergraphs, Multiway Spectral Graph Partitioning: Cut Functions, Cheeger Inequalities, and a Simple Algorithm, Classification of graphs by Laplacian eigenvalue distribution and independence number, A family of gradient methods using Householder transformation with application to hypergraph partitioning, Nodal domain theorems for \(p\)-Laplacians on signed graphs, On model-based clustering of directional data with heavy tails, On the stability of the principal ratio, On the spectra and spectral radii of token graphs, Persistent hyperdigraph homology and persistent hyperdigraph Laplacians, Consensus formation in first-order graphon models with time-varying topologies, Unnamed Item, Laplacian spectra of cographs: a twin reduction perspective, Distributed optimal consensus protocol for high-order integrator-type multi-agent systems, Decentralized navigation method for swarm robots with individual loss due to failure, On spectra of power graphs of finite cyclic and dihedral groups, Extremal Graph Realizations and Graph Laplacian Eigenvalues, The most exigent eigenvalue: guaranteeing consensus under an unknown communication topology and time delays, Perturbation of Fiedler vector: interest for graph measures and shape analysis, About the type of broom trees, Hypergraph analysis based on a compatible tensor product structure, Research on entropy weight multiple criteria decision‐making evaluation of metro network vulnerability, Integral Laplacian graphs with a unique repeated Laplacian eigenvalue. I, Synchronization in directed nonlinear complex networks under intermittent stochastic control, Mean distance on metric graphs, COMPLEX LAPLACIAN-BASED DISTRIBUTED CONTROL FOR MULTI-AGENT NETWORK, Ordering trees by algebraic connectivity, The number of spanning trees of a graph, On sum of powers of the Laplacian eigenvalues of graphs, On sum of powers of the Laplacian eigenvalues of graphs, On the \(k\)th largest eigenvalue of the Laplacian matrix of a graph, Discrete nodal domain theorems, On graphs with equal algebraic and vertex connectivity, Spectral characterization of some weighted rooted graphs with cliques, Edge-connectivity in regular multigraphs from eigenvalues, Upper bounds on the Laplacian spread of graphs, On some characterizations of strong power graphs of finite groups, A unified method for eigendecomposition of graph products, On the sum of powers of Laplacian eigenvalues of bipartite graphs, On the sum of powers of Laplacian eigenvalues of bipartite graphs, Some properties of the distance Laplacian eigenvalues of a graph, Eigenvalue bounds for some classes of matrices associated with graphs, On the restricted numerical range of the Laplacian matrix for digraphs, Scalable module detection for attributed networks with applications to breast cancer, Fiedler vector analysis for particular cases of connected graphs, On the pancyclicity of 1-tough graphs
Cites Work
