Results 41 to 50 of about 2,693,458 (344)
Vertex Graceful Labeling-Some Path Related Graphs [PDF]
, 2013 Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, Smarandachely vertex m ...
Balaganesan, P. +2 more
core +1 more source
On the edge irregularity strength of grid graphs
AKCE International Journal of Graphs and Combinatorics, 2020 For a simple graph G, a vertex labeling is called a vertex -labeling. For any edge in , its weight . If all the edge weights are distinct, then is called an edge irregular -labeling of .
I. Tarawneh, R. Hasni, A. Ahmad
doaj +1 more source
On labeling in graph visualization [PDF]
Information Sciences, 2007 When visualizing graphs, it is essential to communicate the meaning of each graph object via text or graphical labels. Automatic placement of labels in a graph is an NP-Hard problem, for which efficient heuristic solutions have been recently developed.
Ugur Dogrusöz +3 more
openaire +3 more sources
, 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
On the study of Rainbow Antimagic Coloring of Special Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . The bijective function is said to be a labeling of graph where is the associated weight for edge .
Dafik Dafik +3 more
doaj +1 more source
Electronic Journal of Combinatorics, 2018 A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening 50 years nearly 200 graph labelings techniques have been studied in
J. Gallian
semanticscholar +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
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
Discrete Mathematics, 2013 Which graphs admit an integer value harmonic function which is injective and surjective onto $\Z$? Such a function, which we call harmonic labeling, is constructed when the graph is the $\Z^2$ square grid. It is shown that for any finite graph $G$ containing at least one edge, there is no harmonic labeling of $ G \times \Z$.
Itai Benjamini +3 more
openaire +2 more sources
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