ScholarLens Back to search
2015•Zenodo (CERN European Organization for Nuclear Research)Open access

A Note On Prime And Sequential Labelings Of Finite Graphs

Mathew Varkey T.K, Sunoj. B.S

Open full text 0 citations

Abstract

A labeling or valuation of a graph G is an assignment f of labels to the vertices of G that induces for each edge xy a label depending on the vertex labels f(x) and f(y). In this paper, we study some classes of graphs and their corresponding labelings.

About this research paper

What this paper is about

A labeling or valuation of a graph G is an assignment f of labels to the vertices of G that induces for each edge xy a label depending on the vertex labels f(x) and f(y). In this paper, we study some classes of graphs and their corresponding labelings.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A labeling or valuation of a graph G is an assignment f of labels to the vertices of G that induces for each edge xy a label depending on the vertex labels f(x) and f(y). In this paper, we study some classes of graphs and their corresponding labelings.

Key concepts: Combinatorics, Edge-graceful labeling, Mathematics, Discrete mathematics, Vertex (graph theory), Graph labeling, Graph, Line graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Note On Prime And Sequential Labelings Of Finite Graphs — Research Paper | ScholarLens