On Sequential Graphs
Journal Title: Bulletin of Pure and Applied Sciences Sec. E - Mathematics and Statistics - Year 2018, Vol 37, Issue 1
Abstract
A labeling or valuation of a graph G is an assignment f of labels to the vertices of G that indices 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 which admit sequential labeling
Authors and Affiliations
S. Selestin Lina
Keywords
Related Articles
- EP ID EP531627
- DOI 10.5958/2320-3226.2018.00007.3
- Views 151
- Downloads 0
INDEPENDENT VERIFICATION OF EULER’S FORMULA IN GRAPH THEORY FOR N IDENTICAL CIRCLES
This paper discusses the famous Euler’s formula in graph theory and its independent verification for the case of n identical circles forming a planar graph. A planar connected graph is generated using n circles, and an i...
ON DIVISOR CORDIAL GRAPH
In this paper we prove that some known graphs such as the Herschel graph and some graphs constructed in this paper are divisor cordial graphs.
A STUDY ON THE EFFECTIVE EDGES IN THE CARTESIAN PRODUCT OF FUZZY GRAPHS
In this paper we discuss the number of effective edges in the Cartesian product of fuzzy graphs. Some basic theorems and results are obtained on effective edges. Based on the results we find the effective edge domination...
Reliability Analysis of Six Unit Bridge and Parallel Series Networks With Critical and Non-Critical Human Errors
Humans play a pivotal role in the design, development and operational phases of engineering systems. Reliability evaluation of systems without taking into consideration the human element does not provide a realistic pict...
VARIANCE BALANCED INCOMPLETE BLOCK DESIGNS
This paper provides two new series for the construction for General Efficiency Balanced Incomplete Block Design using the combinatorial arrangement of Efficiency Balanced Incomplete Block Designs.