Laplacian eigenvectors and eigenvalues and almost equitable partitions

DOI10.1016/j.ejc.2005.03.006zbMath1114.05057MaRDI QIDQ872021

Domingos Moreira Cardoso, Paula Rama, Charles Delorme

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

Mathematics Subject Classification ID

05E30: Association schemes, strongly regular graphs

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

Related Items

Graph partitions and cluster synchronization in networks of oscillators, Invariant Synchrony Subspaces of Sets of Matrices, Controllability and observability of multi-agent systems with general linear dynamics under switching topologies, Vertex types in some lexicographic products of graphs, Consensus for Agents with Double Integrator Dynamics in Heterogeneous Networks, Strong Cospectrality and Twin Vertices in Weighted Graphs, On the Laplacian spectrum of \(k\)-symmetric graphs, On integer matrices with integer eigenvalues and Laplacian integral graphs, Perfect state transfer in Laplacian quantum walk, Spectra of generalized compositions of graphs and hierarchical networks, Characteristic polynomials of ramified uniform covering digraphs, Spectral results on graphs with regularity constraints, Controllability of multi-agent systems with directed and weighted signed networks, Model reduction of linear multi-agent systems by clustering with \(\mathcal H_2\) and \(\mathcal H_\infty \) error bounds, Minimizing Kirchhoff index among graphs with a given vertex bipartiteness, On multi-consensus and almost equitable graph partitions, Disturbance decoupling problem for multi-agent systems: a graph topological approach, Hybrid consensus for multi-agent systems with time-driven jumps, Cluster partitioning of heterogeneous multi-agent systems, Nonlinear integral coupling for synchronization in networks of nonlinear systems, Fractional revival of threshold graphs under Laplacian dynamics, Characterizing controllable subspace and herdability of signed weighted networks via graph partition, An overview of \((\kappa, \tau)\)-regular sets and their applications, Almost equitable partitions and new necessary conditions for network controllability, Almost equitable partitions and controllability of leader-follower multi-agent systems

Cites Work

• Spectral results on regular graphs with \((k,\tau)\)-regular sets
• The walk partition and colorations of a graph
• Problems in algebraic combinatorics
• On graphs with three eigenvalues
• Equitable bipartitions of graphs and related results
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item