Saved in:
Bibliographic Details
Main Authors: Morsy, Muhammed Alaa, Anwar, Mohamed, Aboutahoun, Abdallah
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2404.11806
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911844856233984
author Morsy, Muhammed Alaa
Anwar, Mohamed
Aboutahoun, Abdallah
author_facet Morsy, Muhammed Alaa
Anwar, Mohamed
Aboutahoun, Abdallah
contents In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final graph with a self-similar structure. The number of spanning trees of a graph is one of the most graph-theoretical parameters, where its applications range from the theory of networks to theoretical chemistry. Two explicit formulas are introduced for the number of spanning trees for the two models. With explicit formulas for some of their topological parameters as well.
format Preprint
id arxiv_https___arxiv_org_abs_2404_11806
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle The Number of Spanning Trees in some Special Self-Similar Graphs
Morsy, Muhammed Alaa
Anwar, Mohamed
Aboutahoun, Abdallah
Combinatorics
In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final graph with a self-similar structure. The number of spanning trees of a graph is one of the most graph-theoretical parameters, where its applications range from the theory of networks to theoretical chemistry. Two explicit formulas are introduced for the number of spanning trees for the two models. With explicit formulas for some of their topological parameters as well.
title The Number of Spanning Trees in some Special Self-Similar Graphs
topic Combinatorics
url https://arxiv.org/abs/2404.11806