Results 31 to 40 of about 140,706 (235)
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
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
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
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
IEEE Access, 2021 Optical motion capture (MOCAP) is a commonly used technology to record the motion of non-rigid objects with high accuracy in 3D space. However, the MOCAP data has to be processed further before it can be used. The scattered reconstructed motion data must
Jianfang Li +3 more
doaj +1 more source
Crystallizing the hypoplactic monoid: from quasi-Kashiwara operators to the Robinson--Schensted--Knuth-type correspondence for quasi-ribbon tableaux [PDF]
, 2016 Crystal graphs, in the sense of Kashiwara, carry a natural monoid structure given by identifying words labelling vertices that appear in the same position of isomorphic components of the crystal.
Cain, Alan J., Malheiro, António
core +2 more sources
Applied Mathematics and Computation, 2019 It is well known that the labeling problems of graphs arise in many (but not limited to) networking and telecommunication contexts. In this paper we introduce the anti-$k$-labeling problem of graphs which we seek to minimize the similarity (or distance) of neighboring nodes.
Xiaxia Guan +4 more
openaire +3 more sources
On L(d,1)-labelling of Trees [PDF]
Mathematics Interdisciplinary Research, 2020 Given a graph G and a positive integer d, an L(d,1)-labelling of G is a function f that assigns to each vertex of G a non-negative integer such that if two vertices u and v are adjacent, then |f(u)-f(v)|≥ d and if u and v are at distance two, then |f(u ...
Irena Hrastnik, Janez Žerovnik
doaj +1 more source
Classifying textile designs using region graphs [PDF]
, 2010 Markov random field pixel labelling is often used to obtain image segmentations in which each segment or region is labelled according to its attributes such as colour or texture.
Edwards, Keith +3 more
core +3 more sources