Results 41 to 50 of about 882,414 (306)
New Families of Mean Graphs [PDF]
, 2010 A graph that admits a Smarandachely super mean m-labeling is called Smarandachely super m-mean ...
Selvam, Avadayappan
core +1 more source
Theory and Applications of Graphs, 2020 In his classical paper [14], Rosa introduced a hierarchical series of labelings called ρ, σ, β and α labeling as a tool to settle Ringel’s Conjecture which states that if T is any tree with m edges then the complete graph K2m+1 can be decomposed into 2m +
G. Sethuraman, M. Sujasree
doaj +1 more source
The Odd Harmonious Labeling of Layered Graphs
JTAM (Jurnal Teori dan Aplikasi Matematika), 2023 Graphs that have the properties of odd harmonious labeling are odd harmonious graphs. The research objective of this paper is to obtain odd harmonious labeling on layered graph C(x,y) and layered graph D(x,y).
Fery Firmansah
doaj +1 more source
Super Fibonacci Graceful Labeling of Some Special Class of Graphs [PDF]
, 2011 A Fibonacci graceful labeling and a super Fibonacci graceful labeling on graphs were introduced by Kathiresan and Amutha in ...
Sridevi, R. +2 more
core +1 more source
Gaussian Tribonacci R-Graceful Labeling of Some Tree Related Graphs
Ratio Mathematica, 2022 Let r be any natural number. An injective function , where is the Gaussian Tribonacci number in the Gaussian Tribonacci sequence is said to be Gaussian Tribonacci r-graceful labeling if the induced edge labeling such that is bijective.
K Sunitha, M Sheriba
doaj +1 more source
Colourings of graphs by labellings
Electronic Notes in Discrete Mathematics, 2017 Abstract In this paper we give a survey on several types of colourings of elements of graphs by different types of labellings.
Martin Baca, Stanislav Jendrol'
openaire +1 more source
Labeling, Covering and Decomposing of Graphs — Smarandache’s Notion in Graph Theory [PDF]
, 2010 This paper surveys the applications of Smarandache’s notion to graph theory appeared in International J.Math.Combin. from Vol.1,2008 to Vol.3,2009.
Mao, Linfan, Linfan Mao
core +1 more source
Neutrosophic Divisor Cordial Labeling Graphs [PDF]
Neutrosophic Sets and SystemsIn this paper we introduced a novel concept – Neutrosophic Divisor Cordial Labeling a have proved that graphs such as wheels, helms and closed helm graph satisfy this new labeling. This paper builds upon our previous work in Neutrosophic Cordial Labeling
Tephilla Joice P, A.Rajkumar
doaj +1 more source
Some Results on Super Mean Graphs [PDF]
, 2009 Approaching topics such as labeling, Smarandachely super mean labeling, Smarandachely super m-mean graph, super mean labeling, super mean ...
Nagarajan, A., Vasuki, R.
core +1 more source
Swapping Labeled Tokens on Graphs [PDF]
Theoretical Computer Science, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katsuhisa Yamanaka +9 more
openaire +7 more sources