Vertex Coloring and Eulerian and Hamiltonian Paths of Delaunay Graphs Associated with Sensor Networks
In this paper, we explore the connection between sensor networks and graph theory. Sensor networks represent distributed systems of interconnected devices that collect and transmit data, while graph theory provides a robust framework for modeling and analyzing complex networks. Specifically, we focu...
Saved in:
Main Authors: | Manuel Ceballos, María Millán |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2024-12-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/13/1/55 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Subsemi-Eulerian graphs
by: Charles Suffel, et al.
Published: (1982-01-01) -
Inter-frame image coding scheme of color video based on Delaunay triangulation mesh
by: JIAO Wei-dong, et al.
Published: (2007-01-01) -
Protein-DNA interactions: statistical analysis of interatomic contacts in major and minor grooves
by: A. A. Anashkina, et al.
Published: (2018-01-01) -
Gateway Deployment Optimization in Wireless Mesh Backbone Network Based on Closeness Centrality
by: Chengxin Guo, et al.
Published: (2015-02-01) -
CONDITIONS FOR GRAPHS ON n VERTICES WITH THE SUM OF DEGREES OF ANY TWO NONADJACENT VERTICES EQUAL TO n-2 TO BE A HAMILTONIAN GRAPH
by: Nhu An Do, et al.
Published: (2024-02-01)