Pushpa Publishing House

Journal Menu

Content

Volume 41 (2024)

Volume 40 (2023)

Volume 39 (2023)

Volume 38 (2023)

Volume 29 (2022)

Volume 28 (2021)

Volume 27 (2021)

Volume 26 (2021)

Volume 25 (2020)

Volume 24 (2020)

Volume 23 (2020)

Volume 22 (2019)

Volume 21 (2019)

Volume 20 (2019)

Volume 19 (2018)

Volume 18 (2017)

Volume 17 (2016)

Volume 16 (2015)

Volume 15 (2015)

Volume 14 (2014)

Volume 13 (2014)

Volume 12 (2013)

Volume 11 (2013)

Volume 10 (2012)

Volume 7 (2011)

Volume 6 (2010)

Volume 5 (2010)

Volume 4 (2009)

Volume 3 (2009)

Volume 2 (2008)

	Volume 2, Issue 2 Pg 85 - 163 (October 2008)
	Volume 2, Issue 1 Pg 1 - 84 (July 2008)

Volume 1 (2008)

-->

Advances and Applications in Discrete Mathematics

Abstract:
Let G be a graph with

and

It is said to be a factor of a non-DS graph if

and

are cospectral. We denote by

In this paper the method for constructing a factor of a non-DS graph is given, and some factors of non-DS graphs and cospectral graphs are also obtained.

Keywords and phrases: cospectral graphs, adjacency spectrum, non-DS graph.

Number of Downloads: 347 | Number of Views: 927

Previous Next

P-ISSN: 0974-1658

Journal Stats

Publication count: 605

Citation count (Google Scholar): 1017

h10-index (Google Scholar): 24

h-index (Google Scholar): 15

Downloads : 137251

Views: 629283

Downloads/publish articles: 226.86

Citations (Google Scholar)/publish articles: 1.68