Results 1 to 10 of about 251,015 (167)
Solutions of Detour Distance Graph Equations [PDF]
Sensors, 2022 Graph theory is a useful mathematical structure used to model pairwise relations between sensor nodes in wireless sensor networks. Graph equations are nothing but equations in which the unknown factors are graphs.
S. Celine Prabha +7 more
doaj +2 more sources
ON DETERMINING THE DISTANCE SPECTRUM OF A CLASS OF DISTANCE INTEGRAL GRAPHS [PDF]
Journal of Algebraic Systems, 2023 The distance eigenvalues of a connected graph $G$ are the eigenvalues of its distance matrix$D(G)$. A graph is called distance integral if all of itsdistance eigenvalues are integers.Let $n$ and $k$ be integers with $n>2k, k\geq1$.
Seyed M. Mirafzal, R. Kogani
doaj +1 more source
IEEE Access, 2022 The use of face masks has become a widespread non-pharmaceutical practice to mitigate the transmission of COVID-19. However, achieving accurate facial detection while people wear masks or similar face occlusions is a major challenge.
Firas Albalas +4 more
doaj +1 more source
Al-Rafidain Journal of Computer Sciences and Mathematics, 2023 The new distance defined on a connected graph G contains of three terms: The ordinary distance between any two vertices in G, both the sum and the product of the two vertices' degrees, as this distance is more useful than the ordinary distance ...
Asmaa Aziz
doaj +1 more source
A Study on Discrete Mathematics: Sum Distance in Neutrosophic Graphs with Application [PDF]
Neutrosophic Sets and Systems, 2020 Distance is an important parameter in any networks/ graphs. The idea of strong sum distance in the fuzzy graph was introduced by Tom and Sunitha (2015).
Kousik Dasa +4 more
doaj +1 more source
On the distance spectra of m-generation n-prism graph
AKCE International Journal of Graphs and Combinatorics, 2022 The distance matrix of a simple connected graph G is [Formula: see text] where dij is the length of a shortest path between the ith and jth vertices of G. Eigenvalues of D(G) are called the distance eigenvalues of G. The m-generation n-prism graph or (m,
Fouzul Atik +2 more
doaj +1 more source
On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Christian Löwenstein +2 more
doaj +1 more source
Monophonic Distance in Graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2011 For any two vertices u and v in a connected graph G, a u – v path is a monophonic path if it contains no chords, and the monophonic distance dm(u, v) from u to v is defined as the length of a longest u – v monophonic path in G. A u – v monophonic path of length dm(u, v) is called a u – v monophonic. The monophonic eccentricity em(v) of a vertex v in G
A. P. Santhakumaran, P. Titus
openaire +2 more sources
Distance labeling in graphs [PDF]
Journal of Algorithms, 2004 Summary: We consider the problem of labeling the nodes of a graph in a way that will allow one to compute the distance between any two nodes directly from their labels (without using any additional information). Our main interest is in the minimal length of labels needed in different cases.
Gavoille, Cyril +3 more
openaire +4 more sources
Distance Domination and Distance Irredundance in Graphs [PDF]
The Electronic Journal of Combinatorics, 2007 A set $D\subseteq V$ of vertices is said to be a (connected) distance $k$-dominating set of $G$ if the distance between each vertex $u\in V-D$ and $D$ is at most $k$ (and $D$ induces a connected graph in $G$). The minimum cardinality of a (connected) distance $k$-dominating set in $G$ is the (connected) distance $k$-domination number of $G$, denoted ...
Adriana Hansberg +2 more
openaire +2 more sources