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
ACCELERATION MOTION OF A SINGLE VERTICALLY FALLING NON-SPHERICAL PARTICLE IN INCOMPRESSIBLE NON-NEWTONIAN FLUID BY DIFFERENT METHODS
An analytical investigation is applied for acceleration motion of a vertically falling non-spherical particle in a Shear-thinning (n<1) and Shear-thickening (n>1) power low fluid. The acceleration motion of vertically fa...
WIENER INDEX OF PHYSIO-CHEMICAL LABELED GRAPH
In this paper by the term Wiener Lower sum we mean the Wiener index. Mathematically, the Wiener index of a graph is defined as the sum of distances between all pairs of vertices in a connected graph. Here we obtain the...
Some Fixed Point Theorems for Mappings on Complete 〖 S〗_b –Metric Space
In this paper, we prove some common fixed point theorems in S_b-metric space using an increasing function ϕ∶[0,∞)→[0,∞) with lim┬(n→∞)〖ϕ^n (t)=0〗 and ϕ(t)<t for each fixed t>0. Our results extend the result of...
TYPES OF DOMINATION IN INTUITIONISTIC FUZZY GRAPH BY STRONG ARC AND EFFECTIVE ARC
In this paper, we introduce the definitions of strong arc, non- strong arc, semi μ- strong arc, semi ρ- strong arc, effective arc, semi μ-effective arc and semi ρ-effective arc of intuitionistic fuzzy graph. Further,...
Neighborhood Cordial (Nhd-C) Labeling - A New Method of Graph Labeling
We introduce a new technique of graph labeling named as Neighborhood Cordial (Nhd-C) Labeling of Graphs and show that paths, cycles, FL (Cn), S (C3,n), pathunion Pm(C3), Pm (C4),K1,m: K1,m , TreeYn are nhd-c graphs.