Laplacian eigenvectors and eigenvalues and almost equitable partitions

DOI10.1016/J.EJC.2005.03.006zbMATH Open1114.05057OpenAlexW2062745455MaRDI QIDQ872021FDOQ872021

Authors: D. M. Cardoso, Paula Rama, C. 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

Recommendations

• Laplacian eigenvalues and partition problems in hypergraphs
• Laplacian eigenvalues and multisections
• On the multiplicity of Laplacian eigenvalues and Fiedler partitions
• On the eigenvectors of \(p\)-Laplacian
• Laplacian eigenvalues and fixed size multisection
• Laplacian eigenvalues of equivalent cographs
• Some properties of Laplacian eigenvectors
• scientific article
• Optimal partitions for first eigenvalues of the Laplace operator
• scientific article; zbMATH DE number 2114072

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30)

Cites Work

• The walk partition and colorations of a graph
• Problems in algebraic combinatorics
• On graphs with three eigenvalues
• Equitable bipartitions of graphs and related results
• Title not available (Why is that?)
• Spectral results on regular graphs with \((k,\tau)\)-regular sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (32)

• 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
• 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
• Graph partitions and cluster synchronization in networks of oscillators
• Equitable edge partitions and Kirchhoff graphs
• An overview of \((\kappa, \tau)\)-regular sets and their applications
• Hybrid consensus for multi-agent systems with time-driven jumps
• Invariant synchrony subspaces of sets of matrices
• Controllability and observability of multi-agent systems with general linear dynamics under switching topologies
• Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
• Consensus for agents with double integrator dynamics in heterogeneous networks

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)