|
|
|
|
on minimum algebraic connectivity of tricyclic graphs
|
|
|
|
|
|
|
|
نویسنده
|
taheri hassan ,fath-tabar gholam hossein
|
|
منبع
|
mathematics interdisciplinary research - 2024 - دوره : 9 - شماره : 2 - صفحه:185 -197
|
|
چکیده
|
consider a simple, undirected graph $ g=(v,e)$, where $a$ represents the adjacency matrix and $q$ represents the laplacian matrix of $g$. the second smallest eigenvalue of laplacian matrix of $g$ is called the algebraic connectivity of $g$. in this article, we present a python program for studying the laplacian eigenvalues of a graph. then, we determine the unique graph of minimum algebraic connectivity in the set of all tricyclic graphs.
|
|
کلیدواژه
|
algebraic connectivity، bicyclic graph، tricyclic graph، python programming language
|
|
آدرس
|
university of kashan, faculty of mathematical science, department of pure mathematics, iran, university of kashan, faculty of mathematical science, department of pure mathematics, iran
|
|
پست الکترونیکی
|
fathtabar@kashanu.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|