Results 101 to 110 of about 8,068,470 (244)
On resolving domination number of special family of graphs
Journal of Physics: Conference Series, 2020 Let G be a simple, finite, and connected graph. A dominating set D is a set of vertices such that each vertex of G is either in D or has at least one neighbor in D.
Y. Wangguway +4 more
semanticscholar +1 more source
Overlarge sets of resolvable idempotent quasigroups
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Y. Chang +3 more
openaire +2 more sources
Metric Dimension of Circulant Graphs with 5 Consecutive Generators
MathematicsThe problem of finding the metric dimension of circulant graphs with t generators 1,2,…,t (and their inverses) has been extensively studied. The problem is solved for t=2,3,4, and some exact values and bounds are known also for t=5. We solve all the open
Martin Knor +2 more
doaj +1 more source
Computing Metric Dimension of Certain Families of Toeplitz Graphs
IEEE Access, 2019 The position of a moving point in a connected graph can be identified by computing the distance from the point to a set of sonar stations which have been appropriately situated in the graph. Let Q = {q1, q2, ...
Jia-Bao Liu +3 more
doaj +1 more source
Edge Version of Metric Dimension and Doubly Resolving Sets of the Necklace Graph
Mathematics, 2018 Consider an undirected and connected graph G = ( V G , E G ) , where V G and E G represent the set of vertices and the set of edges respectively. The concept of edge version of metric dimension and doubly resolving sets is based on the distances of edges
Jia-bao Liu +3 more
semanticscholar +1 more source
Hermitian geometry on resolvent set(I)
, 2016 For a tuple $A=(A_1,\ A_2,\ ...,\ A_n)$ of elements in a unital Banach algebra ${\mathcal B}$, its projective joint spectrum $P(A)$ is the collection of $z\in {\mathbb C}^n$ such that $A(z)=z_1A_1+z_2A_2+\cdots +z_nA_n$ is not invertible. It is known that the ${\mathcal B}$-valued $1$-form $ _A(z)=A^{-1}(z)dA(z)$ contains much topological information ...
Douglas, Ronald G., Yang, Rongwei
openaire +2 more sources
Total resolving number of edge cycle graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a simple connected graph. An ordered subset W of V is said to be a resolving set of G if every vertex is uniquely determined by its vector of distances to the vertices in W. The minimum cardinality of a resolving set is called the resolving number
J. Paulraj Joseph, N. Shunmugapriya
doaj +1 more source
Metric dimension of star fan graph
Scientific ReportsEvery node in a network is said to be resolved if it can be uniquely identified by a vector of distances to a specific set of nodes. The metric dimension is equivalent to the least possible cardinal number of a resolving set.
S. Prabhu +2 more
doaj +1 more source
On the Families of Graphs With Unbounded Metric Dimension
IEEE Access, 2019 A family G of connected graphs is a family with unbounded metric dimension if dim(G) is not constant and depends on the order of graph. In this paper, we compute the metric dimension of the splitting graphs S(Pn) and S(Cn) of a path and cycle.
Heng Pan +4 more
doaj +1 more source
Metric dimension of dual polar graphs
, 2017 A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$.
Bailey, Robert F., Spiga, Pablo
core