Results 11 to 20 of about 118,378,802 (306)
On the Distance Pattern Distinguishing Number of a Graph [PDF]
Journal of Applied Mathematics, 2014 Let G=(V,E) be a connected simple graph and let M be a nonempty subset of V. The M-distance pattern of a vertex u in G is the set of all distances from u to the vertices in M.
Sona Jose, Germina K. Augustine
doaj +2 more sources
Solutions of Detour Distance Graph Equations
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
Reciprocal degree distance of some graph operations [PDF]
Transactions on Combinatorics, 2013 The reciprocal degree distance (RDD), defined for a connected graph G as vertex-degreeweighted sum of the reciprocal distances, that is, RDD(G) = u,v∈PV(G) dG(u)+dG(v) dG(u,v) . The reciprocal degree distance is a weight version of the Harary index, just
Kannan Pattabiraman, M. Vijayaragavan
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
Efficient Point-to-Point Resistance Distance Queries in Large Graphs [PDF]
, 2023 We describe a method to efficiently compute point-to-point resistance distances in a graph, which are notoriously difficult to compute from the raw graph data. Our method is based on a relatively compact hierarchical data structure which “compresses” the
Hormann, Kai +3 more
core +1 more source
On a class of metrics related to graph layout problems [PDF]
, 2010 We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1.
Theis, D O +3 more
core +5 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 +5 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 +3 more sources
Exact Distance Graphs of Product Graphs [PDF]
Graphs and Combinatorics, 2019 Given a graph $G$, the exact distance-$p$ graph $G^{[\natural p]}$ has $V(G)$ as its vertex set, and two vertices are adjacent whenever the distance between them in $G$ equals $p$. We present formulas describing the structure of exact distance-$p$ graphs of the Cartesian, the strong, and the lexicographic product.
Brešar, Boštjan +3 more
openaire +5 more sources
, 2020 In this article, our ultimate goal is to transform a graph’s adjacency matrix into a distance matrix. Because cluster density is not observable prior to the actual clustering, our goal is to find a distance whose pairwise minimization will lead to densely connected clusters.
Miasnikof, Pierre +4 more
openaire +2 more sources