Results 21 to 30 of about 5,977,062 (227)
The Knowlton-Graham partition problem [PDF]
A set partition technique that is useful for identifying wires in cables can be recast in the language of 0–1 matrices, thereby resolving an open problem stated by R. L. Graham in Volume 1 of this journal.
Donald E. Knuth, Knuth, Donald E.
core +1 more source
An Introduction to Partition Logic [PDF]
Classical logic is usually interpreted as the logic of propositions. But from Boole's original development up to modern categorical logic, there has always been the alternative interpretation of classical logic as the logic of subsets of any given ...
Ellerman, David
core +1 more source
Dimensi Metrik Graf Kr+mKsr, m, r, s, En
The concept of minimum resolving set has proved to be useful and or related to a variety of fields such as Chemistry, Robotic Navigation, and Combinatorial Search and Optimization. So that, this thesis explains the metric dimension of graph Kr + mKsr, m,
Hindayani Hindayani
doaj +1 more source
Bounds on partition dimension of Peterson graphs
The distance of a connected, simple graph P is denoted by d(eta(1), eta(2)), which is the length of a shortest path between the vertices eta(1), eta(2) is an element of V(P), where V(P) is the vertex set of P. The l- ordered partition of V(P) is theta = (
Azeem, Muhammasd +9 more
core +1 more source
THE PARTITION DIMENSION AND $k$-DOMINATION NUMBER OF TWO SPECIFIC GRAPHS [PDF]
For an ordered $k$-partition $\Omega = \{S_1, S_2, ..., S_k\}$ of vertex set of a connected graph $G$ and a vertex $v$ of $G$, the representation of $v$ with respect to $\Omega$ is defined as the $k$-tuple $r(v |\Omega) = (d(v, S_1), d(v, S_2), ..., d(v,
Ali Zafari, Saeid Alikhani
doaj +1 more source
Conditional resolvability in graphs: a survey
For an ordered set W={w1,w2,…,wk} of vertices and a vertex v in a connected graph G, the code of v with respect to W is the k-vector cW(v)=(d(v,w1),d(v,w2),…,d(v,wk)), where d(x,y) represents the distance between the vertices x and y.
Varaporn Saenpholphat, Ping Zhang
doaj +1 more source
Partition Dimension of Generalized Hexagonal Cellular Networks and Its Application
The notion of partition dimension was initially introduced in the field of graph theory, primarily to examine distances between vertices. The local partition dimension extends this idea by incorporating specific conditions into how vertices are ...
Rabnawaz Bhatti +3 more
doaj +1 more source
Trees with Certain Locating-chromatic Number
The locating-chromatic number of a graph G can be defined as the cardinality of a minimum resolving partition of the vertex set V(G) such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices in G are ...
Dian Kastika Syofyan +2 more
doaj +1 more source
Cardinality bounds on subsets in the partition resolving set for complex convex polytope-like graph
<abstract><p>Let $ G = (V, E) $ be a simple, connected graph with vertex set $ V(G) $ and $ E(G) $ edge set of $ G $. For two vertices $ a $ and $ b $ in a graph $ G $, the distance $ d(a, b) $ from $ a $ to $ b $ is the length of shortest path $ a-b $ path in $ G $. A $ k $-ordered partition of vertices of $ G $ is represented as $ {R}{p} =
Ali N. A. Koam +3 more
openaire +2 more sources
On the Locating Chromatic Number of Certain Barbell Graphs
The locating chromatic number of a graph G is defined as the cardinality of a minimum resolving partition of the vertex set V(G) such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices in G are not ...
Asmiati +2 more
doaj +1 more source

