Results 31 to 40 of about 919,081 (302)

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 Prime Index of a Graph

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

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

Evacuation of labelled graphs

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

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

Super Mean Labeling of Some Classes of Graphs [PDF]

, 2012
Approaching topics as Smarandachely super m-mean labeling, Smarandachely super m-mean graph, super mean labeling, super mean ...
P.Jeyanthi, D.Ramya, Jeyanthi, P., Ramya, D.   +3 more
core   +1 more source

Decomposition of Certain Complete Graphs and Complete Multipartite Graphs into Almost-bipartite Graphs and Bipartite Graphs

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

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., Renuka, J., Selvaraju, P.   +2 more
core   +1 more source

Graph labeling games [PDF]

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, Fioravantes, Foivos, Nisse, Nicolas   +2 more
openaire   +8 more sources