Results 1 to 10 of about 140,706 (235)
Proof of a local antimagic conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 An antimagic labelling of a graph $G$ is a bijection $f:E(G)\to\{1,\ldots,E(G)\}$ such that the sums $S_v=\sum_{e\ni v}f(e)$ distinguish all vertices. A well-known conjecture of Hartsfield and Ringel (1994) is that every connected graph other than $K_2 ...
John Haslegrave
doaj +5 more sources
Probabilistic regular graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extension of regular graphs obtained by labelling the terminal arcs of the graph ...
Christophe Morvan, Nathalie Bertrand
doaj +7 more sources
Automated cone photoreceptor detection using synthetic data and deep learning in confocal adaptive optics scanning laser ophthalmoscope images [PDF]
Scientific ReportsAdaptive 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
Shifted-Antimagic Labelings for Graphs [PDF]
Graphs and Combinatorics, 2021 The concept of antimagic labelings of a graph is to produce distinct vertex sums by labeling edges through consecutive numbers starting from one. A long-standing conjecture is that every connected graph, except a single edge, is antimagic. Some graphs are known to be antimagic, but little has been known about sparse graphs, not even trees.
Fei-Huang Chang +3 more
openaire +3 more sources
Neutrosophic Fuzzy Magic Labeling Graph with its Application in Academic Performance of the Students [PDF]
Neutrosophic Sets and Systems, 2023 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
On Elegant Labelling and Magic Labelling of Large-Scale Graphs
Discrete Dynamics in Nature and Society, 2022 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
Cubo, 2021 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
A proof system for graph (non)-isomorphism verification [PDF]
Logical Methods in Computer Science, 2023 In order to apply canonical labelling of graphs and isomorphism checking in interactive theorem provers, these checking algorithms must either be mechanically verified or their results must be verifiable by independent checkers. We analyze a state-of-the-
Milan Banković +2 more
doaj +1 more source
Distance Two Surjective Labelling of Paths and Interval Graphs
Discrete Dynamics in Nature and Society, 2021 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
Journal of Function Spaces, 2022 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