Results 41 to 50 of about 280,140 (285)
On the Implicit Graph Conjecture [PDF]
, 2016 The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder.
Chandoo, Maurice
core +3 more sources
On H-irregular reflexive labeling of graph
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 By an irregular reflexive labeling, we mean a function and such that if and if , where max . Let , the irregular reflexive labeling is called an -irregular reflexive -labeling of graph if every two different sub graphs and isomorphic to , it ...
Marsidi Marsidi +4 more
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
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
Electronic Notes in Discrete Mathematics, 2017 This paper contains part of a keynote talk at IWOGL 2016, Krakow, Poland, July 7-9 ...
openaire +3 more sources
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
Universal Communication, Universal Graphs, and Graph Labeling [PDF]
, 2019 We introduce a communication model called universal SMP, in which Alice and Bob receive a function f belonging to a family ?, and inputs x and y. Alice and Bob use shared randomness to send a message to a third party who cannot see f, x, y, or the shared
Harms, Nathaniel
core +2 more sources
, 2015 We propose a new family of discrete energy minimization problems, which we call parsimonious labeling. Specifically, our energy functional consists of unary potentials and high-order clique potentials. While the unary potentials are arbitrary, the clique
Dokania, Puneet K., Kumar, M. Pawan
core +4 more sources