Laplacian eigenvectors and eigenvalues and almost equitable partitions
From MaRDI portal
Publication:872021
DOI10.1016/J.EJC.2005.03.006zbMATH Open1114.05057OpenAlexW2062745455MaRDI QIDQ872021FDOQ872021
D. M. Cardoso, C. Delorme, Paula Rama
Publication date: 27 March 2007
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2005.03.006
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The walk partition and colorations of a graph
- Problems in algebraic combinatorics
- On graphs with three eigenvalues
- Equitable bipartitions of graphs and related results
- Spectral results on regular graphs with \((k,\tau)\)-regular sets
Cited In (31)
- Spectral results on graphs with regularity constraints
- Characterizing controllable subspace and herdability of signed weighted networks via graph partition
- Consensus and multi-consensus for discrete-time LTI systems
- On multi-consensus and almost equitable graph partitions
- Comments on ``On multi-consensus and almost equitable graph partitions
- Disturbance decoupling problem for multi-agent systems: a graph topological approach
- Nonlinear integral coupling for synchronization in networks of nonlinear systems
- Scalable synchronization cluster in networked chaotic oscillators
- Perfect state transfer in Laplacian quantum walk
- Strong Cospectrality and Twin Vertices in Weighted Graphs
- Cluster partitioning of heterogeneous multi-agent systems
- Characteristic polynomials of ramified uniform covering digraphs
- Invariant Synchrony Subspaces of Sets of Matrices
- Controllability of multi-agent systems with directed and weighted signed networks
- A generalization of Fiedler's lemma and its applications
- Model reduction of linear multi-agent systems by clustering with \(\mathcal H_2\) and \(\mathcal H_\infty \) error bounds
- Unified understanding and new results of controllability model of multiβagent systems
- Almost equitable partitions and controllability of leader-follower multi-agent systems
- On the Laplacian spectrum of \(k\)-symmetric graphs
- On integer matrices with integer eigenvalues and Laplacian integral graphs
- Laplacian eigenvalues and partition problems in hypergraphs
- Spectra of generalized compositions of graphs and hierarchical networks
- Vertex types in some lexicographic products of graphs
- Almost equitable partitions and new necessary conditions for network controllability
- Fractional revival of threshold graphs under Laplacian dynamics
- Consensus for Agents with Double Integrator Dynamics in Heterogeneous Networks
- Graph partitions and cluster synchronization in networks of oscillators
- An overview of \((\kappa, \tau)\)-regular sets and their applications
- Hybrid consensus for multi-agent systems with time-driven jumps
- Controllability and observability of multi-agent systems with general linear dynamics under switching topologies
- Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Laplacian eigenvalues and partition problems in hypergraphs π π
- Some properties of Laplacian eigenvectors π π
- Laplacian eigenvalues and fixed size multisection π π
- On the multiplicity of Laplacian eigenvalues and Fiedler partitions π π
- On the eigenvectors of \(p\)-Laplacian π π
- Laplacian eigenvalues and multisections π π
- Optimal partitions for first eigenvalues of the Laplace operator π π
- Laplacian eigenvalues of equivalent cographs π π
This page was built for publication: Laplacian eigenvectors and eigenvalues and almost equitable partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q872021)