The following pages link to (Q4873761):
Displaying 50 items.
- Structure of cell networks critically determines oscillation regularity (Q285207) (← links)
- Some results on the Laplacian spread of a graph (Q290672) (← links)
- Asymptotic Laplacian-energy-like invariant of lattices (Q298828) (← links)
- Spectral properties of unimodular lattice triangulations (Q300599) (← links)
- On the spectral gap of a quantum graph (Q312228) (← links)
- Decentralized gradient algorithm for solution of a linear equation (Q330302) (← links)
- Towards objective measures of algorithm performance across instance space (Q336954) (← links)
- Asymptotic behavior of the number of Eulerian orientations of graphs (Q358192) (← links)
- Adaptive exponential synchronization of coupled complex networks on general graphs (Q370271) (← links)
- A discrete Gauss-Green identity for unbounded Laplace operators, and the transience of random walks (Q375875) (← links)
- Nonlinear multilayered representation of graph-signals (Q385311) (← links)
- Nonpositive eigenvalues of the adjacency matrix and lower bounds for Laplacian eigenvalues (Q392638) (← links)
- Parabolic theory of the discrete \(p\)-Laplace operator (Q393209) (← links)
- Ky Fan theorem applied to Randić energy (Q401164) (← links)
- Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks (Q417470) (← links)
- Spectral and graph-theoretic bounds on steady-state-probability estimation performance for an ergodic Markov chain (Q430187) (← links)
- A new consensus algorithm for multi-agent systems via decentralized dynamic output feedback (Q444740) (← links)
- Consensus formation control for a class of networked multiple mobile robot systems (Q446436) (← links)
- Energy of generalized line graphs (Q448388) (← links)
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra (Q486728) (← links)
- Effective graph resistance (Q550630) (← links)
- On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs (Q556891) (← links)
- A note on the von Neumann entropy of random graphs (Q603103) (← links)
- Graphs with given diameter maximizing the algebraic connectivity (Q603120) (← links)
- Conductance in discrete dynamical systems (Q623909) (← links)
- The Laplacian spectral radii of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices (Q625799) (← links)
- Algebraic connectivity of connected graphs with fixed number of pendant vertices (Q659677) (← links)
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian (Q662288) (← links)
- Partial characterization of graphs having a single large Laplacian eigenvalue (Q668039) (← links)
- Hermitian Laplacian matrix and positive of mixed graphs (Q668641) (← links)
- On the adjacency, Laplacian, and signless Laplacian spectrum of coalescence of complete graphs (Q670591) (← links)
- Laplace eigenvalues of graphs---a survey (Q686298) (← links)
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II) (Q686466) (← links)
- Graceful labelling: state of the art, applications and future directions (Q691624) (← links)
- Spectra of generalized compositions of graphs and hierarchical networks (Q710577) (← links)
- Conjectures on index and algebraic connectivity of graphs (Q710881) (← links)
- Spectral methods for graph clustering - a survey (Q713095) (← links)
- Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains (Q724523) (← links)
- Combinatorial optimization of special graphs for nodal ordering and graph partitioning (Q731499) (← links)
- A generalization of the graph Laplacian with application to a distributed consensus algorithm (Q747494) (← links)
- Drawing graphs by eigenvectors: theory and practice (Q814052) (← links)
- Spectral properties of the Laplacian on bond-percolation graphs (Q818789) (← links)
- Topology-invariant similarity of nonrigid shapes (Q847482) (← links)
- Upper bounds on algebraic connectivity via convex optimization (Q855560) (← links)
- Minimizing the Laplacian eigenvalues for trees with given domination number (Q865427) (← links)
- Spectral partitioning works: planar graphs and finite element meshes (Q869898) (← links)
- On the Laplacian coefficients of acyclic graphs (Q875026) (← links)
- Global binary optimization on graphs for classification of high-dimensional data (Q890097) (← links)
- Domination number and Laplacian eigenvalue distribution (Q901155) (← links)
