The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Towards a spectral theory of graphs based on the signless Laplacian, I
Abstract
A spectral graph theory is a theory in which graphs are studied by means of eigenvalues of a matrix M which is in a prescribed way defined for any graph. This theory is called M-theory. We outline a spectral theory of graphs based on the signless Laplacians Q and compare it with other spectral theories, in particular with those based on the adjacency matrix A and the Laplacian L. The Q-theory can be composed using various connections to other theories: equivalency with A-theory and L-theory for regular graphs, or with L-theory for bipartite graphs, general analogies with A-theory and analogies with A-theory via line graphs and subdivision graphs. We present results on graph operations, inequalities for eigenvalues and reconstruction problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Harary, F. (1969) · Cited by 10,739
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
cacute, C., Vs, M., Doob, M., & Sachs, H. (1980) · Cited by 1,478
Which graphs are determined by their spectrum?
van Dam, E. R., & Haemers, W. H. (2003) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(03)00483-x · Cited by 654
Cvetkovic, D., Rowlinson, P., & Simic, S. (1997) · Cambridge University Press eBooks · doi:10.1017/cbo9781139086547 · Cited by 531
Self-citationSignless Laplacians of finite graphs
Cvetković, D., Rowlinson, P., & Simić, S. K. (2007) · Linear Algebra and its Applications · doi:10.1016/j.laa.2007.01.009 · Cited by 495
A study of graph spectra for comparing graphs and trees
Wilson, R. C., & Zhu, P. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2008.03.011 · Cited by 240
Maximizing the sum of the squares of the degrees of a graph
Das, K. C. (2004) · Discrete Mathematics · doi:10.1016/j.disc.2004.04.007 · Cited by 213
Towards a spectral theory of graphs based on the signless Laplacian, II
Cvetković, D., & Simić, S. K. (2010) · Linear Algebra and its Applications · doi:10.1016/j.laa.2009.05.020 · Cited by 199
On incidence energy of a graph
Gutman, İ., Kiani, D., Mirzakhah, M., & Zhou, B. (2009) · Linear Algebra and its Applications · doi:10.1016/j.laa.2009.04.019 · Cited by 138
Cited by
Huang, C.-H., Tsai, J. J. P., Kurubanjerdjit, N., & Ng, K.-L. (2019) · doi:10.1101/536318 · Cited by 4
Metadata
- Authors
- Cvetkovic, D., & Simic, S.
- Venue
- Publications de l'Institut Mathematique
- Publisher
- National Library of Serbia
- Published
- 2009
- Volume
- 85
- Issue
- 99
- Pages
- 19-33
- ISSN
- 0350-1302 (ISSN-L)
- 1820-7405
- OpenAlex
- W2066315387
- Cited by
- 280
- References
- 13
- FWCI
- 29.21
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Towards a spectral theory of graphs based on the signless Laplacian, I. https://app.cochat.ai/papers/10.2298/pim0999019c
- The paper
- Cvetkovic, D., & Simic, S. (2009). Towards a spectral theory of graphs based on the signless Laplacian, I. Publications de l'Institut Mathematique. https://doi.org/10.2298/pim0999019c
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.