Spectrum of Unicyclic Graph
Budi Rahadjeng*, Dwi Nur Yunianti, Raden Sulaiman, Agung Lukito
Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Negeri Surabaya
*Corresponding author. Email: email@example.com
Available Online 8 February 2022.
- 10.2991/acsr.k.220202.004How to use a DOI?
- Characteristic polynomial; Spectrum of the graph; Unicyclic graph
Let G be a simple graph with n vertices and let A(G) be the (0, 1)-adjacency matrix of G. The characteristic polynomial of the graph G with respect to the adjacency matrix A(G), denoted by χ(G, λ) is a determinant of (λI − A(G)), where I is the identity matrix. Suppose that λ1 ≥ λ2 ≥ ⋯ ≥ λn are the adjacency eigenvalues of G. The spectrum of the graph G, denoted by Spec(G), is the multiset of its adjacency eigenvalues. Unicyclic graph is connected graph containing exactly one cycle. In this paper we determine the spectrum of unicyclic graph containing cycle with length 6.
- © 2022 The Authors. Published by Atlantis Press International B.V.
- Open Access
- This is an open access article under the CC BY-NC license.
Cite this article
TY - CONF AU - Budi Rahadjeng AU - Dwi Nur Yunianti AU - Raden Sulaiman AU - Agung Lukito PY - 2022 DA - 2022/02/08 TI - Spectrum of Unicyclic Graph BT - Proceedings of the International Conference on Mathematics, Geometry, Statistics, and Computation (IC-MaGeStiC 2021) PB - Atlantis Press SP - 17 EP - 21 SN - 2352-538X UR - https://doi.org/10.2991/acsr.k.220202.004 DO - 10.2991/acsr.k.220202.004 ID - Rahadjeng2022 ER -