scientific article; zbMATH DE number 907925
From MaRDI portal
Publication:4886769
zbMATH Open0857.05072MaRDI QIDQ4886769FDOQ4886769
Authors: Norbert Seifter, Clemens W. Brand
Publication date: 6 March 1997
Full work available at URL: https://eudml.org/doc/31832
Title of this publication is not available (Why is that?)
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)
Cites Work
Cited In (18)
- LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER
- A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities
- Bounds of Laplacian spectrum of graphs based on the domination number
- Eigenvalues and homology of flag complexes and vector representations of graphs
- Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
- Bounds on graph eigenvalues. I
- The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
- Laplacian and signless Laplacian spectral radii of graphs with fixed domination number
- Domination and spectral graph theory
- Efficient domination through eigenvalues
- Eigenvalues and separation in graphs
- The spectral radius and domination number in linear uniform hypergraphs
- Largest eigenvalue of the Laplacian matrix: its eigenspace and transitive orientations
- Laplacian distribution and domination
- Domination number and Laplacian eigenvalue distribution
- The \(k\)-domination number and bounds for the Laplacian eigenvalues of graphs
- A note on Laplacian eigenvalues and domination
- Eigenvalues and the diameter of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886769)