Results 1 to 10 of about 24,189 (265)
Two types irregular labelling on dodecahedral modified generalization graph
Irregular labelling on graph is a function from component of graph to non-negative natural number such that the weight of all vertices, or edges are distinct. The component of graph is a set of vertices, a set of edges, or a set of both. In this paper we
Nurdin Hinding +4 more
doaj +3 more sources
Many schema labelling approaches have been designed to facilitate querying of XML documents. The proposed algorithms are based on the fact that ancestor–descendant relationships among nodes can be quickly determined.
Awny Sayed +2 more
doaj +3 more sources
Automated cone photoreceptor detection using synthetic data and deep learning in confocal adaptive optics scanning laser ophthalmoscope images [PDF]
Adaptive optics scanning laser ophthalmoscope (AOSLO) imaging enables the cone photoreceptor mosaic to be visualised in the living human eye. Performing quantitative analysis of these images requires identification of individual photoreceptors.
Mital Shah +4 more
doaj +2 more sources
Edge even graceful labelling of new families of graphs
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. A graph G is called edge even graceful if there is a bijection $f: E(G) \rightarrow \{2, 4,\ldots , 2q\} $ such that ...
S. N. Daoud, Ahmed N. Elsawy
doaj +2 more sources
Neutrosophic Fuzzy Magic Labeling Graph with its Application in Academic Performance of the Students [PDF]
Graph labelling is the assignment of labels to the edges, vertices, or both. The issue of limiting the spread of non-interfering frequencies allotted to radio transmitters serves as the motivation for the research on labelling graphs according to ...
S. Sudha +3 more
doaj +1 more source
Dispersed graph labellings [PDF]
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)$.
William J. Martin, Douglas R. Stinson
openaire +3 more sources
On Elegant Labelling and Magic Labelling of Large-Scale Graphs
In this paper, we deduce the equivalence relationship among strongly c-elegant labelling, super-edge magic total labelling, edge antimagic total labelling, and super t,1-magical labelling.
Jing Su, Hongyu Wang, Bing Yao
doaj +1 more source
A new class of graceful graphs: k-enriched fan graphs and their characterisations
The Graceful Tree Conjecture stated by Rosa in the mid 1960s says that every tree can be gracefully labelled. It is one of the best known open problems in Graph Theory.
M. Haviar, S. KurtulĂk
doaj +1 more source
Distance Two Surjective Labelling of Paths and Interval Graphs
Graph labelling problem has been broadly studied for a long period for its applications, especially in frequency assignment in (mobile) communication system, X-ray crystallography, circuit design, etc.
Sk Amanathulla +3 more
doaj +1 more source
For applied scientists and engineers, graph theory is a strong and vital tool for evaluating and inventing solutions for a variety of issues. Graph theory is extremely important in complex systems, particularly in computer science.
A. El-Mesady, Omar Bazighifan
doaj +1 more source

