The Kemeny’s Constant and Spanning Trees of Hexagonal Ring Network
نویسندگان
چکیده
Spanning tree () has an enormous application in computer science and chemistry to determine the geometric dynamics analysis of compact polymers. In field medicines, it is helpful recognize epidemiology hepatitis C virus (HCV) infection. On other hand, Kemeny’s constant a beneficial quantifier characterizing universal average activities Markov chain. This network invariant infers expressions expected number time-steps required trace randomly selected terminus state since fixed beginning . Levene Loizou determined that can also be obtained through eigenvalues. Motivated by Loizou, we deduced spanning trees hexagonal ring their normalized Laplacian eigenvalues coefficients characteristic polynomial. Based on achieved results, entirely results are for Möbius network.
منابع مشابه
Counting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملanalysis of power in the network society
اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...
15 صفحه اولSocial network sampling using spanning trees
Due to the large scales and limitations in accessing most online social networks, it is hard or infeasible to directly access them in a reasonable amount of time for studying and analysis. Hence, network sampling has emerged as a suitable technique to study and analyze real networks. The main goal of sampling online social networks is constructing a small scale sampled network which preserves t...
متن کاملIncremental Network Design with Minimum Spanning Trees
Given an edge-weighted graph G = (V,E) and a set E0 ⊂ E, the incremental network design problem with minimum spanning trees asks for a sequence of edges e1, . . . , e ′ r ∈ E \ E0 minimizing ∑T t=1 w(Xt) where w(Xt) is the weight of a minimum spanning tree Xt for the subgraph (V,E0 ∪ {e1, . . . , et}) and T = |E \ E0|. We prove that this problem can be solved by a greedy algorithm.
متن کاملOn relation between the Kirchhoff index and number of spanning trees of graph
Let $G=(V,E)$, $V={1,2,ldots,n}$, $E={e_1,e_2,ldots,e_m}$,be a simple connected graph, with sequence of vertex degrees$Delta =d_1geq d_2geqcdotsgeq d_n=delta >0$ and Laplacian eigenvalues$mu_1geq mu_2geqcdotsgeqmu_{n-1}>mu_n=0$. Denote by $Kf(G)=nsum_{i=1}^{n-1}frac{1}{mu_i}$ and $t=t(G)=frac 1n prod_{i=1}^{n-1} mu_i$ the Kirchhoff index and number of spanning tree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers, materials & continua
سال: 2022
ISSN: ['1546-2218', '1546-2226']
DOI: https://doi.org/10.32604/cmc.2022.031958