Results 21 to 30 of about 35,950 (265)
Dualizing Distance-Hereditary Graphs
Discussiones Mathematicae Graph Theory, 2021 Distance-hereditary graphs can be characterized by every cycle of length at least 5 having crossing chords. This makes distance-hereditary graphs susceptible to dualizing, using the common extension of geometric face/vertex planar graph duality to cycle ...
McKee Terry A.
doaj +1 more source
ON SPANNERS OF GEOMETRIC GRAPHS [PDF]
International Journal of Foundations of Computer Science, 2006 Given a connected geometric graph G, we consider the problem of constructing a t-spanner of G having the minimum number of edges. We prove that for every real number t with [Formula: see text], there exists a connected geometric graph G with n vertices, such that every t-spanner of G contains Ω(n1+1/t) edges.
Gudmundsson, Joachim, Smid, Michiel
openaire +2 more sources
Rule-based transformations for geometric modelling [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 The context of this paper is the use of formal methods for topology-based geometric modelling. Topology-based geometric modelling deals with objects of various dimensions and shapes.
Thomas Bellet +2 more
doaj +1 more source
The effects of random geometric graph structure and clustering on localizability of sensor networks
International Journal of Distributed Sensor Networks, 2017 Graph rigidity provides the conditions of unique localizability for cooperative localization of wireless ad hoc and sensor networks. Specifically, redundant rigidity and 3-connectivity are necessary and sufficient conditions for unique localizability of ...
Tolga Eren
doaj +1 more source
The graph isomorphism problem on geometric graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Special issue PRIMA ...
Ryuhei Uehara
doaj +1 more source
Molecular geometric deep learning
Cell Reports: Methods, 2023 Summary: Molecular representation learning plays an important role in molecular property prediction. Existing molecular property prediction models rely on the de facto standard of covalent-bond-based molecular graphs for representing molecular topology ...
Cong Shen, Jiawei Luo, Kelin Xia
doaj +1 more source
Annals of Combinatorics, 2011 Cameron and Kazanidis have recently shown that rank-3 graphs are either cores or have complete cores, and they asked whether this holds for all strongly regular graphs. We prove that this is true for the point graphs and line graphs of generalized quadrangles and that when the number of points is sufficiently large, it is also true for the block graphs
Godsil, Chris, Royle, Gordon F.
openaire +3 more sources
Entropy, 2018 We introduce a definition of algorithmic symmetry in the context of geometric and spatial complexity able to capture mathematical aspects of different objects using as a case study polyominoes and polyhedral graphs.
Hector Zenil +2 more
doaj +1 more source
Ars Mathematica Contemporanea, 2012 42 pages, 25 figures; co-author added in replaced ...
Boutin, Debra L. +3 more
openaire +3 more sources
Vertex-Based Topological Indices of Double and Strong Double Graph of Dutch Windmill Graph
Journal of Chemistry, 2021 A measurement of the molecular topology of graphs is known as a topological index, and several physical and chemical properties such as heat formation, boiling point, vaporization, enthalpy, and entropy are used to characterize them.
Muhammad Asad Ali +3 more
doaj +1 more source