Pushpa Publishing House

Journal Menu

Content

Volume 42 (2025)

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 5, Issue 2 Pg 85 - 169 (April 2010)
	Volume 5, Issue 1 Pg 1 - 83 (January 2010)

Volume 4 (2009)

Volume 3 (2009)

Volume 2 (2008)

Volume 1 (2008)

-->

Advances and Applications in Discrete Mathematics

Abstract:
In this paper, we introduce a new type of labeling called relaxed Skolem mean labeling. We prove, if

is not a relaxed Skolem mean graph, the two stars

is a relaxed Skolem mean graph if and only if

the three stars

is a relaxed Skolem mean graph if

for

the three stars

is a relaxed Skolem mean graph if

for

and any path is a relaxed Skolem mean graph. Also, we prove the relaxed Skolem mean labelings are linearly independent from the Skolem mean labeling.

Keywords and phrases: Skolem mean graph, relaxed Skolem mean graph, path and star.

Number of Downloads: 282 | Number of Views: 925

Previous Next

P-ISSN: 0974-1658

E-ISSN: 3049-2157

Journal Stats

Publication count: 630

Citation count (Google Scholar): 1076

h10-index (Google Scholar): 29

h-index (Google Scholar): 15

Downloads : 150578

Views: 704270

Downloads/publish articles: 239.01

Citations (Google Scholar)/publish articles: 1.71