Results 31 to 40 of about 882,414 (306)
, 2010 A graph that admits a Smarandachely near mean m-labeling is called Smarandachely near m-mean graph. The graph that admits a near mean labeling is called a near mean graph (NMG)
Nagarajan, A. +2 more
core +1 more source
Discrete Mathematics, 1994 In this note, Schützenberger's notion of evacuation of Young tableaux [\textit{M. P. Schützenberger}, Math. Scand. 12, 117-128 (1963; Zbl 0216.302)] and of naturally labelled posets [\textit{M. P. Schützenberger}, Discrete Math. 2, 73-94 (1972; Zbl 0279.06001)] are extended to labelled graphs.
MALVENUTO, Claudia, REUTENAUER C.
openaire +3 more sources
Odd Harmonious Labeling of Some Graphs [PDF]
, 2012 The labeling of discrete structures is a potential area of research due to its wide range of applications.
Shah, N.H., Vaidya, S.K.
core +1 more source
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
, 2011 A graph that has a Smarandachely vertex-mean k-labeling is called Smarandachely k vertex-mean graph or Smarandachely k V -mean graph. Particularly, if k = 0, such a Smarandachely vertex-mean 0-labeling and Smarandachely 0 vertex-mean graph or ...
Lourdusamy, A., Seenivasan, M.
core +1 more source
Lucas Graceful Labeling for Some Graphs [PDF]
, 2011 By a graph, we mean a finite undirected graph without loops or multiple ...
Perumal, M.A. +2 more
core +1 more source
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
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
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
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 +8 more sources