|
|
|
|
the coalescence of multi-wheel and starlike graphs is dls
|
|
|
|
|
|
|
|
نویسنده
|
ahangarani farahani mohammad hasan ,fath-tabar gholam hossein
|
|
منبع
|
journal of mahani mathematical research - 2025 - دوره : 14 - شماره : 2 - صفحه:99 -111
|
|
چکیده
|
The laplacian spectrum of a graph is obtained by taking the difference of the adjacency spectrum from the diagonal matrix of degrees. if a graph has a unique laplacian spectrum, it means that it can be identified by this spectrum, it is called $dls$. in this article, we first introduce the graph resulting from the integration of a starlike tree and a multi-wheel graph at the vertices with the maximum degree of these two graphs. then, we check whether it is $dls$.
|
|
کلیدواژه
|
laplacian spectrum ,dls graph ,coalescence of graphs
|
|
آدرس
|
university of kashan, faculty of mathematical sciences, department of pure mathematics, iran, university of kashan, faculty of mathematical sciences, department of pure mathematics, iran
|
|
پست الکترونیکی
|
fathtabar@kashanu.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|