arXiv (All)
open access
Graph transformations and eigenvectors of the Laplacian, signless Laplacian and Adjacency matrices
We study graph transformations and their effects on the eigenvectors of three fundamental graph matrices: the adjacency matrix $A$, the signless Laplacian $Q$, and the Laplacian $L$. We extend the Laplacian eigenvector edge and matching principles introduced by Merris to $Q$ and $A$. We also extend
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Degree Adjacency Diametrical Matrix of Graphs Spectral Properties and Energy Bounds#1297466
- Strengthened upper bound on the third eigenvalue of graphs#1141400
- Degree-based weighted adjacency matrices: spectra, integrality, and edge deletion effects#998133
- An Iterative Method with Asymptotic Orthogonality for Simultaneous Eigenpair Computation#925887
- More Asymmetry Yields Faster Matrix Multiplication#635535
Record · ID 1233967
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive