Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Degree Splitting of Heronian Mean Graphs
View through CrossRef
<p><span lang="EN-US"><span style="font-family: 宋体; font-size: medium;">In this paper, we prove Heronian Mean labeling of some degree splitting graphs. Already we have proved Heronian Mean labeling for some standard graphs. Here we prove that degree splitting of Path <span lang="EN-US">P<sub>3</sub></span></span></span><span lang="EN-US"><span style="font-family: 宋体; font-size: medium;">, Path <span lang="EN-US">P<sub>4</sub></span>, <span lang="EN-US">P<sub>3</sub>ʘK<sub>1</sub></span></span></span><span lang="EN-US"><span><span style="font-family: 宋体; font-size: medium;">, <span lang="EN-US">P<sub>2</sub>ʘK<sub>1,2</sub></span>, <span lang="EN-US">P<sub>2</sub>ʘK<sub>1,3</sub></span>, <span><span><sub> </sub></span></span><span lang="EN-US">P<sub>2</sub>ʘK<sub>3</sub></span> </span></span><span style="font-family: 宋体; font-size: medium;">are Heronian Mean graphs.</span></span></p>
Canadian Center of Science and Education
Title: Degree Splitting of Heronian Mean Graphs
Description:
<p><span lang="EN-US"><span style="font-family: 宋体; font-size: medium;">In this paper, we prove Heronian Mean labeling of some degree splitting graphs.
Already we have proved Heronian Mean labeling for some standard graphs.
Here we prove that degree splitting of Path <span lang="EN-US">P<sub>3</sub></span></span></span><span lang="EN-US"><span style="font-family: 宋体; font-size: medium;">, Path <span lang="EN-US">P<sub>4</sub></span>, <span lang="EN-US">P<sub>3</sub>ʘK<sub>1</sub></span></span></span><span lang="EN-US"><span><span style="font-family: 宋体; font-size: medium;">, <span lang="EN-US">P<sub>2</sub>ʘK<sub>1,2</sub></span>, <span lang="EN-US">P<sub>2</sub>ʘK<sub>1,3</sub></span>, <span><span><sub> </sub></span></span><span lang="EN-US">P<sub>2</sub>ʘK<sub>3</sub></span> </span></span><span style="font-family: 宋体; font-size: medium;">are Heronian Mean graphs.
</span></span></p>.
Related Results
Dual Hesitant Pythagorean Fuzzy Heronian Mean Operators in Multiple Attribute Decision Making
Dual Hesitant Pythagorean Fuzzy Heronian Mean Operators in Multiple Attribute Decision Making
On account of the indeterminacy and subjectivity of decision makers (DMs) in complexity decision-making environments, the evaluation information over alternatives presented by DMs ...
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...
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...
Tablet Splitting: Influence of Technique and Tablet Format
Tablet Splitting: Influence of Technique and Tablet Format
Tablet splitting is a commonly used technique to obtain half of the dose or to facilitate tablet intake. However, there is a risk of not obtaining the correct dose and the efficacy...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
The area of Data Analytics on graphs promises a paradigm shift, as we approach information processing of new classes of data which are typically acquired on irregular but structure...