Log in

Relevant bibliographies by topics / Smarandachely super m-mean graph

Contents

Journal articles

Academic literature on the topic 'Smarandachely super m-mean graph'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Smarandachely super m-mean graph.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Smarandachely super m-mean graph"

1

Sudha, N. "Coding through on the disconnected graph $nK_{1, m}$, $n > 1$ a super mean labeling graph." Malaya Journal of Matematik S, no. 1 (2020): 668–72. http://dx.doi.org/10.26637/mjm0s20/0127.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Vasuki, R., and A. Nagarajan. "Some Results on Super Mean Graphs." May 1, 2009. https://doi.org/10.5281/zenodo.9459.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Jeyanthi, P., and D. Ramya. "Super Mean Labeling of Some Classes of Graphs." May 3, 2012. https://doi.org/10.5281/zenodo.9355.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Selvam, Avadayappan. "New Families of Mean Graphs." September 12, 2010. https://doi.org/10.5281/zenodo.9354.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Vaidya, S.K. "New Mean Graphs." August 23, 2011. https://doi.org/10.5281/zenodo.9363.

Full text

Abstract:

A graph that admits a Smarandachely super mean m-labeling is called a Smarandachely super m-mean graph, particularly, a mean graph if m = 2. In this paper, some new families of mean graphs are investigated. We prove that the graph obtained by two new operations called mutual duplication of a pair of vertices each from each copy of cycle Cn as well as mutual duplication of a pair of edges each from each copy of cycle Cn admits mean labeling. 

APA, Harvard, Vancouver, ISO, and other styles

6

P.Jeyanthi and D.Ramya. "Super Mean Labeling of Some Classes of Graphs." April 20, 2012. https://doi.org/10.5281/zenodo.814526.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Balaji, V. "Solution of a Conjecture on Skolem Mean Graph." March 1, 2011. https://doi.org/10.5281/zenodo.9495.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Nagarajan, A., Murugan A. Nellai, and Krishnan S. Navaneetha. "On Near Mean Graphs." May 22, 2010. https://doi.org/10.5281/zenodo.9338.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

R.Sridevi, S.Navaneethakrishnan, and K.Nagarajan. "Super Fibonacci Graceful Labeling of Some Special Class of Graphs." April 20, 2011. https://doi.org/10.5281/zenodo.814396.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Teena, Liza John, and Varkey T.K Mathew. "Mean Labelings on Product Graphs." August 20, 2014. https://doi.org/10.5281/zenodo.825011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!