ViraScience.
Open-access article

Restricted triangular difference mean graphs

P.Jeyanthi, M.Selvi, D.Ramya

Abstract

No abstract recorded for this item.

Similar items

  • Skolem Odd Difference Mean Graphs

    Article2014Journal of Algorithms and ComputationD. Ramya, P. Jeyanthi, R. Kalaiyarasi

    In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V

  • skolem odd difference mean graphs

    Articlejournal of algorithms and computationp. jeyanthi, principal and head of the research centre,department of mathematics,govindammal aditanar college for women,tiruchendur,tamilnadu,india d. ramya, department of mathematics, dr.sivanthi aditanar college of engineering, tiruchendur- 628 215, india. r. kalaiyarasi, department of mathematics, dr.sivanthi aditanar college of engineering, tiruchendur- 628 215, india.

    in this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. let g = (v,e) be a graph with p vertices and q edges. g is said be skolem odd difference mean if there exists a function f : v

  • Skolem Difference Mean Graphs

    Open-access article2012Mapana - Journal of SciencesKMurugan, ASubramanian

  • On Skolem odd and even difference mean graphs

    Open-access article2018Journal of King Saud University - ScienceGee-ChoonLau, P.Jeyanthi, D.Ramya, R.Kalaiyarasi

  • Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties

    Scholarly record2015Comput. Geom.Ahmad Biniaz, Anil Maheshwari, Michiel H. M. Smid

    We consider an extension of the triangular-distance Delaunay graphs (TD-Delaunay) on a set P of points in general position in the plane. In TD-Delaunay, the convex distance is defined by a fixed-oriented equilateral triangle 5, and there is an edge between two points in P if and

  • Skolem difference mean labeling of disconnected graphs

    Scholarly record2017P. Jeyanthi

    Let G = (V,E) be a graph with p vertices and q edges. G is said to have skolem difference mean labeling if it is possible to label the vertices x ∈ V with distinct elements f(x) from 1, 2, 3, ..., p+ q in such a way that for each edge e = uv, let f∗(e) = l |f(u)−f(v)| 2 m and the