The complexity of some families of cycle-related graphs

In this paper, we derive new formulas for the number of spanning trees of a specific family of graphs – gear graphs, flower graphs, sun graphs and sphere graphs – using techniques from linear algebra, Chebyshev polynomials and matrix theory.

Bibliographic Details
Main Authors:	S.N. Daoud, K. Mohamed
Format:	Article
Language:	English
Published:	Taylor & Francis Group 2017-03-01
Series:	Journal of Taibah University for Science
Subjects:	Spanning trees Chebyshev polynomials Gear graphs Flower graph Sun graph Sphere graph
Online Access:	http://www.sciencedirect.com/science/article/pii/S1658365516300048

id	doaj-7930aff8a08e40d7a6964cd0137bed31
record_format	Article
spelling	doaj-7930aff8a08e40d7a6964cd0137bed312020-11-24T21:25:58ZengTaylor & Francis GroupJournal of Taibah University for Science1658-36552017-03-0111220522810.1016/j.jtusci.2016.04.002The complexity of some families of cycle-related graphsS.N. Daoud0K. Mohamed1Department of Mathematics, Faculty of Science, Taibah University, Al-Madinah 41411, Saudi ArabiaDepartment of Mathematics, Faculty of Science, Taibah University, Al-Madinah 41411, Saudi ArabiaIn this paper, we derive new formulas for the number of spanning trees of a specific family of graphs – gear graphs, flower graphs, sun graphs and sphere graphs – using techniques from linear algebra, Chebyshev polynomials and matrix theory.http://www.sciencedirect.com/science/article/pii/S1658365516300048Spanning treesChebyshev polynomialsGear graphsFlower graphSun graphSphere graph
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	S.N. Daoud K. Mohamed
spellingShingle	S.N. Daoud K. Mohamed The complexity of some families of cycle-related graphs Journal of Taibah University for Science Spanning trees Chebyshev polynomials Gear graphs Flower graph Sun graph Sphere graph
author_facet	S.N. Daoud K. Mohamed
author_sort	S.N. Daoud
title	The complexity of some families of cycle-related graphs
title_short	The complexity of some families of cycle-related graphs
title_full	The complexity of some families of cycle-related graphs
title_fullStr	The complexity of some families of cycle-related graphs
title_full_unstemmed	The complexity of some families of cycle-related graphs
title_sort	complexity of some families of cycle-related graphs
publisher	Taylor & Francis Group
series	Journal of Taibah University for Science
issn	1658-3655
publishDate	2017-03-01
description	In this paper, we derive new formulas for the number of spanning trees of a specific family of graphs – gear graphs, flower graphs, sun graphs and sphere graphs – using techniques from linear algebra, Chebyshev polynomials and matrix theory.
topic	Spanning trees Chebyshev polynomials Gear graphs Flower graph Sun graph Sphere graph
url	http://www.sciencedirect.com/science/article/pii/S1658365516300048
work_keys_str_mv	AT sndaoud thecomplexityofsomefamiliesofcyclerelatedgraphs AT kmohamed thecomplexityofsomefamiliesofcyclerelatedgraphs AT sndaoud complexityofsomefamiliesofcyclerelatedgraphs AT kmohamed complexityofsomefamiliesofcyclerelatedgraphs
_version_	1725981614635220992

The complexity of some families of cycle-related graphs

Similar Items