EUVIMEDEUVIMED entdecken
Crossref

Towards a spectral theory of graphs based on the signless Laplacian, I

Dragos Cvetkovic, Slobodan Simic

Publications de l'Institut Mathematique · 2009 · 85 (99) · 19-33

DOI: 10.2298/pim0999019c ↗

Kurz gefasst

Fachartikel in der Zeitschrift Publications de l'Institut Mathematique, 2009. Verfasst von Dragos Cvetkovic und 1 weiteren Autor:innen. Die Arbeit wurde bisher 208-mal zitiert (Crossref) und nennt 19 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Cvetkovic, D., & Simic, S. (2009). Towards a spectral theory of graphs based on the signless Laplacian, I. Publications de l'Institut Mathematique, 85(99), 19-33. https://doi.org/10.2298/pim0999019c

Vancouver

Cvetkovic D, Simic S. Towards a spectral theory of graphs based on the signless Laplacian, I. Publications de l'Institut Mathematique. 2009;85(99):19-33. doi:10.2298/pim0999019c

BibTeX
@article{Cvetkovic2009,
  author = {Cvetkovic, Dragos and Simic, Slobodan},
  title = {Towards a spectral theory of graphs based on the signless Laplacian, I},
  journal = {Publications de l'Institut Mathematique},
  year = {2009},
  volume = {85},
  number = {99},
  pages = {19--33},
  doi = {10.2298/pim0999019c}
}
Kostenlos starten →