Results 21 to 30 of about 24,189 (265)
Total edge irregularity strength of quadruplet and quintuplet book graphs [PDF]
ITM Web of Conferences, 2021 Let G= (V, E) be a finite, simple and undirected graph with a vertex set V and an edge set E. An edge irregular total k-labelling is a function f : V ᴗE → {1,2,…,k} such that for any two different edges xy and x’y’ in E, their weights are distinct.
Ratnasari Lucia +3 more
doaj +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 +2 more sources
Radial Radio Number of Hexagonal and Its Derived Networks
International Journal of Mathematics and Mathematical Sciences, 2021 A mapping ℸ: VG⟶N∪0 for a connected graph G=V,E is called a radial radio labelling if it satisfies the inequality ℸx− ℸ y+dx,y≥radG+1∀x,y∈VG, where radG is the radius of the graph G.
Kins Yenoke +3 more
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
Well-spread sequences and edge-labellings with constant Hamilton-weight [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 A sequence (a_i) of integers is \emphwell-spread if the sums a_i+a_j, for ...
Peter Mark Kayll
doaj +1 more source
Bounding the monomial index and (1,l)-weight choosability of a graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Ben Seamone
doaj +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
On total edge irregularity strength of polar grid graph
Journal of Taibah University for Science, 2019 For a graph $G $, an edge irregular total $r $-labelling $\pi :V \cup E \to \{{1,2,3, \ldots ,r} \} $ is a labelling for edges and vertices of a graph $G $ in such a way that the weights of any two different edges are distinct. The minimum for which $G $
F. Salama
doaj +1 more source
TOTAL EDGE IRREGULARITY STRENGTH DARI GRAF K_n-{e}
E-Jurnal Matematika, 2018 In this paper we determine the total edge irregularity strength of , that is a complete graph in which one of its edge has been removed. To do so, we make three cases.
. MUARDI, QURRATUL AINI, , IRWANSYAH
doaj +1 more source
TOTAL EDGE IRREGULARITY STRENGTH DARI GRAF K_n-{e}
E-Jurnal Matematika, 2019 In this paper we determine the total edge irregularity strength of , that is a complete graph in which one of its edge has been removed. To do so, we make three cases.
MUARDI - ,, QURRATUL AINI, , IRWANSYAH
doaj +1 more source