컨텐츠 시작

학술대회/행사

초록검색

제출번호(No.) 0205
분류(Section) Contributed Talk
분과(Session) (DM) Discrete Mathematics (DM)
발표시간(Time) 19th-B-13:50 -- 14:10
영문제목
(Title(Eng.))
A lower bound for the Laplacian eigenvalues of a unicyclic graph
저자(Author(s))
Sunyo Moon1, Seungkook Park2
KIAS1, Sookmyung Women's University2
초록본문(Abstract) Let $G$ be a simple graph with $n$ vertices. The Laplacian matrix of $G$, denoted by $L(G)$, is defined as the difference between the diagonal matrix of vertex degrees and the adjacency matrix of $G$. The eigenvalues of $L(G)$ are called Laplacian eigenvalues of $G$. In this talk, we provide a lower bound for the number of Laplacian eigenvalues of a unicyclic graph $G$ within the interval $[0,1)$ in terms of the diameter and the girth of $G$. This is joint work with Seungkook Park.
분류기호
(MSC number(s))
15A18, 05C50
키워드(Keyword(s)) Laplacian eigenvalues, unicyclic graph, diameter
강연 형태
(Language of Session (Talk))
English