Results 41 to 50 of about 140,706 (235)
, 2023 A $k$-dispersed labelling of a graph $G$ on $n$ vertices is a labelling of the vertices of $G$ by the integers $1, \dots , n$ such that $d(i,i+1) \geq k$ for $1 \leq i \leq n-1$. $DL(G)$ denotes the maximum value of $k$ such that $G$ has a $k$-dispersed labelling. In this paper, we study upper and lower bounds on $DL(G)$.
Martin, William J., Stinson, Douglas R.
openaire +3 more sources
An Adiabatic Quantum Algorithm for Determining Gracefulness of A Graph
, 2016 Graph labelling is one of the noticed contexts in combinatorics and graph theory. Graceful labelling for a graph $G$ with $e$ edges, is to label the vertices of $G$ with $0, 1, \cdots, e$ such that, if we specify to each edge the difference value between
Darareh, Mahdi Davoudi +3 more
core +1 more source
NLC-2 graph recognition and isomorphism [PDF]
, 2007 NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the class, we propose a $O(n^2 m)$-time algorithm, improving Johansson's ...
B. Courcelle +13 more
core +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.
Mendelsohn, E., Shalaby, N.
openaire +2 more sources
Edge even graceful labelling of some book graphs
Journal of Taibah University for Science, 2018 Elsonbaty and Daoud introduced a new type of labelling of a graph G with p vertices and q edges called an edge even graceful labelling if there is a bijection f from the edges of the graph to the set $\{2, 4,\ldots , 2q\}$ such that, when each vertex is ...
S.N. Daoud, Ahmed N. Elsawy
doaj +1 more source
PELABELAN ODD-GRACEFUL PADA GRAF PRODUK SISIR
Majalah Ilmiah Matematika dan Statistika, 2022 Gnanajothi defined a graph with edges to be odd-graceful if there is an injective function such that if every edge is labelled with the resulting edge labels are . She proved that the graph obtained by joining one pendant to every vertex in is odd-
Juan Daniel +3 more
doaj +1 more source
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 (p, 1)-Total Labelling of Some 1-Planar Graphs
Discussiones Mathematicae Graph Theory, 2021 A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that the (p, 1)-total labelling number (p ≥ 2) of every 1-planar graph G is at most Δ(G) + 2p − 2 provided that Δ (G) ≥
Niu Bei, Zhang Xin
doaj +1 more source
Characterizations of kites as graceful graphs
CuboWe introduce and study an infinite family of graceful graphs, which we call kites. The kites are graphs where a path is joined with a graph "forming" a kite.
Miroslav Haviar, Katarina Kotuľová
doaj +1 more source