DOIAbstract
Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/152495/1/mtks0025579300005222.pd
Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/152495/1/mtks0025579300005222.pd
Abstract. Over the last 30 years, researchers have investigated connections between dimension for po...
Any connected plane nearest neighbor graph has diameter Ω(n^1/6). This bound generalizes to Ω(n^1/3d...
In this paper we prove that the recursive (Knill) dimension of the join of two graphs has a simple f...
Abstract: A graph G = (V, E) is a non-empty collection of vertices and edges, where V is the vertex ...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
http://deepblue.lib.umich.edu/bitstream/2027.42/6739/5/bam7059.0001.001.pdfhttp://deepblue.lib.umich...
Click on the link to view the abstract.Keywords: Resolving set, metric dimension, generalized Peters...
We present the Boolean dimension of a graph, we relate it with the notions of inner, geometric and s...
<p><em>The metric dimension of connected graph G is the cardinality of minimum resolving set in grap...
Given an undirected graph G = (V,E) a metric basis of G is a vertex subset L ⊆ V such that each pair...
Graph invariants provide an amazing tool to analyze the abstract structures of graphs. Metric dimens...
PhDMathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.li...
Research Doctorate - Doctor of Philosophy (PhD)This thesis investigates various resolving parameters...
Graph theory has a large number of applications in the fields of computer networking, robotics, Lora...
Given a simple connected graph G, the metric dimension dim(G) (and edge metric dimension edim(G)) is...
Abstract. Over the last 30 years, researchers have investigated connections between dimension for po...
Any connected plane nearest neighbor graph has diameter Ω(n^1/6). This bound generalizes to Ω(n^1/3d...
In this paper we prove that the recursive (Knill) dimension of the join of two graphs has a simple f...
Abstract: A graph G = (V, E) is a non-empty collection of vertices and edges, where V is the vertex ...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
http://deepblue.lib.umich.edu/bitstream/2027.42/6739/5/bam7059.0001.001.pdfhttp://deepblue.lib.umich...
Click on the link to view the abstract.Keywords: Resolving set, metric dimension, generalized Peters...
We present the Boolean dimension of a graph, we relate it with the notions of inner, geometric and s...
<p><em>The metric dimension of connected graph G is the cardinality of minimum resolving set in grap...
Given an undirected graph G = (V,E) a metric basis of G is a vertex subset L ⊆ V such that each pair...
Graph invariants provide an amazing tool to analyze the abstract structures of graphs. Metric dimens...
PhDMathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.li...
Research Doctorate - Doctor of Philosophy (PhD)This thesis investigates various resolving parameters...
Graph theory has a large number of applications in the fields of computer networking, robotics, Lora...
Given a simple connected graph G, the metric dimension dim(G) (and edge metric dimension edim(G)) is...
Abstract. Over the last 30 years, researchers have investigated connections between dimension for po...
Any connected plane nearest neighbor graph has diameter Ω(n^1/6). This bound generalizes to Ω(n^1/3d...
In this paper we prove that the recursive (Knill) dimension of the join of two graphs has a simple f...
Add to ORKG