Results 51 to 60 of about 2,693,458 (344)
Ratio Mathematica, 2023 In prime labeling, vertices are labeled from 1 to n, with the condition that any two adjacent vertices have relatively prime labels. Coprime labeling maintains the same criterion as prime labeling with adjacent vertices using any set of distinct positive
Janani R, Ramachandran T
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
On Proper Labellings of Graphs with Minimum Label Sum [PDF]
Algorithmica, 2020 The 1-2-3 Conjecture states that every nice graph G (without component isomorphic to [Formula: see text]) admits a proper 3-labelling, i.e., a labelling of the edges with 1, 2, 3 such that no two adjacent vertices are incident to the same sum of labels.
Bensmail, Julien +2 more
openaire +6 more sources
Absolutely Harmonious Labeling of Graphs [PDF]
, 2011 In this paper, we obtain necessary conditions for a graph to be absolutely harmonious and study absolutely harmonious behavior of certain classes of ...
Lourdusamy, A., Seenivasan, M.
core +1 more source
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
A Bucket Graph-Based Labeling Algorithm with Application to Vehicle Routing
Transportation Science, 2020 We consider the shortest path problem with resource constraints arising as a subproblem in state-of-the-art branch-cut-and-price algorithms for vehicle routing problems.
R. Sadykov, Eduardo Uchoa, A. Pessoa
semanticscholar +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