Results 31 to 40 of about 24,189 (265)
Connected Square Network Graphs
Universal Journal of Mathematics and Applications, 2022 In this study, connected square network graphs are introduced and two different definitions are given. Firstly, connected square network graphs are shown to be a Hamilton graph.
Burhan Selçuk
doaj +1 more source
Colourings of graphs by labellings
Electronic Notes in Discrete Mathematics, 2017 Abstract In this paper we give a survey on several types of colourings of elements of graphs by different types of labellings.
Martin Baca, Stanislav Jendrol'
openaire +1 more source
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 +2 more
openaire +6 more sources
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
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
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
On a labeling problem in graphs
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R. Chandrasekaran +2 more
openaire +1 more source
Swapping Labeled Tokens on Graphs [PDF]
Theoretical Computer Science, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katsuhisa Yamanaka +9 more
openaire +6 more sources
A linear time algorithm to compute square of interval graphs and their colouring
AKCE International Journal of Graphs and Combinatorics, 2016 The square of a graph G=(V,E), denoted by G2, is a graph on the same vertex set V(G) such that two vertices x and y are adjacent in G2 if and only if there is a path of length one or two between x and y in G.
Satyabrata Paul +2 more
doaj +1 more source
Discrete Mathematics, 1991 This paper deals with so-called \(d\)-Skolem labelled graphs and \(d\)-hooked Skolem labelled graphs. After quoting and representing main results in terms of \(d\)-Skolem labelled graphs the authors prove a lot of new theorems. Most of them give new classes of \(d\)-Skolem labelled graphs.
Eric Mendelsohn, Nabil Shalaby
openaire +2 more sources