TITLE

On Mean Graphs

AUTHOR(S)
Vasuki, R.; Arockiaraj, S.
PUB. DATE
September 2013
SOURCE
International Journal of Mathematical Combinatorics;Sep2013, Vol. 3, p22
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Let G(V,E) be a graph with p vertices and q edges. For every assignment f : V (G) → {0, 1, 2, 3, ..., q}, an induced edge labeling f* : E(G) → {1, 2, 3, ..., q} is … if f(u) and f(v) are of the same parity otherwise for every edge uv ∈ E(G). If f*(E) = {1, 2, ..., q}, then we say that f is a mean labeling of G. If a graph G admits a mean labeling, then G is called a mean graph. In this paper, we prove that the graphs double sided step ladder graph 2S(Tm), Jelly fish graph J(m, n) for [m - n] ≤ 2, Pn(+)Nm, (P2 kK1) + N2 for k ≥ 1, the triangular belt graph TB(α), TBL(n, α, k, β), the edge mCn - snake, m ≥ 1, n ≥ 3 and St(B(m)(n)) are mean graphs. Also we prove that the graph obtained by identifying an edge of two cycles Cm and Cn is a mean graph for m, n ≥ 3.
ACCESSION #
91942088

 

Related Articles

  • Long Paths and Cycles Passing Through Specified Vertices Under the Average Degree Condition. Li, Binlong; Ning, Bo; Zhang, Shenggui // Graphs & Combinatorics;Jan2016, Vol. 32 Issue 1, p279 

    Let $$G$$ be a $$k$$ -connected graph with $$k\ge 2$$ . In this paper we first prove that: For two distinct vertices $$x$$ and $$z$$ in $$G$$ , it contains a path connecting $$x$$ and $$z$$ which passes through its any $$k-2$$ specified vertices with length at least the average degree of the...

  • Vertex Graceful Labeling-Some Path Related Graphs. Selvaraju, P.; Balaganesan, P.; Renuka, J. // International Journal of Mathematical Combinatorics;Sep2013, Vol. 3, p44 

    In this article, we show that an algorithm for VG of a caterpillar and proved that A(mj, ∪ P3 is vertex graceful if mj is monotonically increasing, 2 ≤ j ≤ n, when n is odd, 1 ≤ m2 ≤ 3 and m1 ≤ m2, (mj, n) ∪ P3 is vertex graceful if mj is monotonically...

  • The Cycle Discrepancy of Three-Regular Graphs. Abbasi, Sarmad; Aslam, Laeeq // Graphs & Combinatorics;Jan2011, Vol. 27 Issue 1, p27 

    Let G = ( V, E) be an undirected graph and $${{\mathcal C}(G)}$$ denote the set of all cycles in G. We introduce a graph invariant cycle discrepancy, which we define as We show that, if G is a three-regular graph with n vertices, then This bound is best possible and is achieved by very simple...

  • A MAGICAL APPROACH TO SOME LABELING CONJECTURES. FIGUEROA-CENTENO, RAMON M.; ICHISHIMA, RIKIO; MUNTANER-BATLE, FRANCESC A.; OSHIMA, AKITO // Discussiones Mathematicae: Graph Theory;2011, Vol. 31 Issue 1, p79 

    No abstract available.

  • On Total Irregularity Strength of Star Graphs, Double-Stars and Caterpillar. Indriati, Diari; Widodo; Wijayanti, Indah E.; Sugeng, Kiki A. // AIP Conference Proceedings;2016, Vol. 1707 Issue 1, p1 

    For a simple graph G = (V,E) with the vertex set V and the edge set E, a totally irregular total k-labeling f : V ∪ E → {1,2, . . ., k} is a labeling of vertices and edges of G in such a way that for any two different vertices x and x', their weights wt f (x) = f (x)+Σxy∈E...

  • QUASIPERFECT DOMINATION IN TRIANGULAR LATTICES. Dejter, Italo J. // Discussiones Mathematicae: Graph Theory;2009, Vol. 29 Issue 1, p179 

    A vertex subset S of a graph G is a perfect (resp. quasiperfect) dominating set in G if each vertex v of G \ S is adjacent to only one vertex (dv ε {1; 2} vertices) of S. Perfect and quasiperfect dominating sets in the regular tessellation graph of Schalai symbol {3; 6} and in its toroidal...

  • EDGE CYCLE EXTENDABLE GRAPHS. McKee, Terry A. // Discussiones Mathematicae: Graph Theory;2012, Vol. 32 Issue 3, p373 

    A graph is edge cycle extendable if every cycle C that is formed from edges and one chord of a larger cycle C+ is also formed from edges and one chord of a cycle C' of length one greater than C with V(C') ⊆ V (C+). Edge cycle extendable graphs are characterized by every block being either...

  • Fuzzy Shortest Path Problem Based on Level λ-Triangular LR Fuzzy Numbers. Elizabeth, S.; Sujatha, L. // Advances in Fuzzy Systems;2012, p1 

    In problems of graphs involving uncertainties, the fuzzy shortest path problem is one of the most studied topics, since it has a wide range of applications in different areas and therefore deserves special attention. In this paper, algorithms are proposed for the fuzzy shortest path problem,...

  • Super Fibonacci Graceful Labeling of Some Special Class of Graphs. Sridevi, R.; Navaneethakrishnan, S.; Nagarajan, K. // International Journal of Mathematical Combinatorics;Mar2011, Vol. 1, p59 

    No abstract available.

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics