Results 41 to 50 of about 2,422,838 (348)
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
Hamiltonian labelings of graphs [PDF]
Involve, a Journal of Mathematics, 2009 For a connected graph G of order n, the detour distance D(u,v) between two vertices u and v in G is the length of a longest u−v path in G. A Hamiltonian labeling of G is a function c:V(G)→ℕ such that |c(u)−c(v)|+D(u,v)≥n for every two distinct vertices u and v of G. The value hn(c) of a Hamiltonian labeling c of G is the maximum label (functional value)
Renzema, Willem, Zhang, Ping
openaire +3 more sources
L(2,1)—labeling of the bracelet graph
Journal of Hebei University of Science and Technology, 2018 In order to better study the channel assignment problem, a function from the vertex set to the set of all nonnegative integers is generated, that is the L(2,1)—labeling of a graph. Let the least label be zero, the L(2,1)—labeling number of a graph is the
Haiping LI, Ying YANG
doaj +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 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
Note on group distance magic graphs $G[C_4]$ [PDF]
, 2012 A \emph{group distance magic labeling} or a $\gr$-distance magic labeling of a graph $G(V,E)$ with $|V | = n$ is an injection $f$ from $V$ to an Abelian group $\gr$ of order $n$ such that the weight $w(x)=\sum_{y\in N_G(x)}f(y)$ of every vertex $x \in V$
D. Froncek +3 more
core +2 more sources
Discrete Mathematics, 1991 AbstractA Skolem labelled graph is a triple (G, L, d), where G = (V, E) is a graph and L:V → d, d + 1,…, d+m satisfying: 1.(a) There are exactly two vertices in V, such that L(v)=d+i, 0 ⩽i⩽m.2.(b) The distance in G between any two vertices with the same label is the value of the label.3.(c) If G' is a proper spanning subgraph of G, (G', L, d) is not a ...
N. Shalaby, Eric Mendelsohn
openaire +2 more sources
-labeling of supersubdivided connected graph plus an edge
AKCE International Journal of Graphs and Combinatorics, 2020 Rosa, in his classical paper (Rosa, 1967) introduced a hierarchical series of labelings called and labeling as a tool to settle Ringel’s Conjecture which states that if is any tree with edges then the complete graph can be decomposed into copies of ...
G. Sethuraman, M. Sujasree
doaj +1 more source
, 2011 A graph that admits a Smarandachely super mean m-labeling is called a Smarandachely super m-mean graph, particularly, a mean graph if m = 2. In this paper, some new families of mean graphs are investigated.
Vaidya, S.K.
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