Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
k-Lehmer three mean labeling of some graphs
View through CrossRef
A function $\mathrm{h}$ is called $\mathrm{k}$ - Lehmer-3 mean graph $\mathrm{G}$ with $\mathrm{r}$ vertices and $\mathrm{s}$ edges, if it is possible to label the vertices $v \in V$ with distinct labels $h(x)$ from $k, k+1, k+2, \ldots, k+s$ in such a way that each edge $e=x y$ is labeled with $h(e)=\left\lceil\frac{h(x)^3+h(y)^3}{h(x)^2+h(y)^2}\right\rceil$ (or) $\left\lfloor\frac{h(x)^3+h(y)^3}{h(x)^2+h(y)^2} \mid\right.$ then the edge labels are distinct.In this paper we proved k-Lehmer-three mean labeling of some standard graphs.
Title: k-Lehmer three mean labeling of some graphs
Description:
A function $\mathrm{h}$ is called $\mathrm{k}$ - Lehmer-3 mean graph $\mathrm{G}$ with $\mathrm{r}$ vertices and $\mathrm{s}$ edges, if it is possible to label the vertices $v \in V$ with distinct labels $h(x)$ from $k, k+1, k+2, \ldots, k+s$ in such a way that each edge $e=x y$ is labeled with $h(e)=\left\lceil\frac{h(x)^3+h(y)^3}{h(x)^2+h(y)^2}\right\rceil$ (or) $\left\lfloor\frac{h(x)^3+h(y)^3}{h(x)^2+h(y)^2} \mid\right.
$ then the edge labels are distinct.
In this paper we proved k-Lehmer-three mean labeling of some standard graphs.
Related Results
Fibonacci Prime Labelling on the Class of Flower Graphs
Fibonacci Prime Labelling on the Class of Flower Graphs
Graph labeling is one of the significant topics in graph theory. One of its interesting variants is Fibonacci prime labeling, a special type of labeling that assigns Fibonacci numb...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
Harmonic Mean Cordial Labeling of Some Known Graphs
Harmonic Mean Cordial Labeling of Some Known Graphs
All graphs considered in this paper are simple, finite, and undirected. A function f:V(G)→{1,2} is said to be a harmonic mean cordial labeling if the induced edge labeling f^*:E(G)...
N‐Terminal Protein Labeling with N‐Hydroxysuccinimide Esters and Microscale Thermophoresis Measurements of Protein‐Protein Interactions Using Labeled Protein
N‐Terminal Protein Labeling with N‐Hydroxysuccinimide Esters and Microscale Thermophoresis Measurements of Protein‐Protein Interactions Using Labeled Protein
AbstractProtein labeling strategies have been explored for decades to study protein structure, function, and regulation. Fluorescent labeling of a protein enables the study of prot...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...
Ld(2,1)-labeling on T-graphs
Ld(2,1)-labeling on T-graphs
In this paper, we are concerned with the [Formula: see text]-Graphs, which are graphs defined based on the Topological structure of the given set. Precisely, for a given topology [...