Results 31 to 40 of about 344,286 (183)
On the Partition Dimension of Tri-Hexagonal α-Boron Nanotube
IEEE Access, 2021 The production of low-cost, small in size, and high in efficiency objects is the topic of research in almost all scientific fields, especially of engineering. In this scenario, nanotechnology becomes of great importance. To achieve these tasks, one needs
Ayesha Shabbir, Muhammad Azeem
doaj +1 more source
Connected partition dimensions of graphs
Discussiones Mathematicae Graph Theory, 2002 For a vertex \(v\) of a connected graph \(G\) and a subset \(S\) of \(V(G)\), the distance between \(v\) and \(S\) is \(d(v,S)=\min \{d(v,x)\mid x\in S\}\). For an ordered \(k\)-partition \(\Pi =\{S_{1},\dots ,S_{k}\}\) of \(V(G)\), the representation of \(v\) with respect to \(\Pi \) is the \(k\)-vector \(r(v|\Pi)=(d(v,S_{1}),\dots ,d(v,S_{k}))\). The
Saenpholphat, Varaporn, Zhang, Ping
openaire +1 more source
Bounds for partition dimension of M-wheels
Open Physics, 2019 Resolving partition and partition dimension have multipurpose applications in computer, networking, optimization, mastermind games and modelling of chemical substances.
Hussain Zafar +6 more
doaj +1 more source
On Partition Dimension of Some Cycle-Related Graphs [PDF]
Mathematical Problems in Engineering, 2021 Let G be a simple connected graph. Suppose Δ = Δ
Changcheng Wei +5 more
openaire +2 more sources
A method to construct graphs with certain partition dimension
Electronic Journal of Graph Theory and Applications, 2019 In this paper, we propose a method for constructing new graphs from a given graph G so that the resulting graphs have the partition dimension at most one larger than the partition dimension of the graph G.
Debi Oktia Haryeni +2 more
doaj +1 more source
Partition dimension of projective planes
European Journal of Combinatorics, 2017 11 ...
Blázsik, Zoltán +1 more
openaire +4 more sources
Further new results on strong resolving partitions for graphs
Open Mathematics, 2020 A set W of vertices of a connected graph G strongly resolves two different vertices x, y ∉ W if either d G(x, W) = d G(x, y) + d G(y, W) or d G(y, W) = d G(y, x) + d
Kuziak Dorota, Yero Ismael G.
doaj +1 more source
A Canonical Form for Positive Definite Matrices [PDF]
, 2020 We exhibit an explicit, deterministic algorithm for finding a canonical form for a positive definite matrix under unimodular integral transformations. We use characteristic sets of short vectors and partition-backtracking graph software.
Haensch, Anna +3 more
core +2 more sources
Set Partition Patterns and the Dimension Index
, 2020 The notion of containment and avoidance provides a natural partial ordering on set partitions. Work of Sagan and of Goyt has led to enumerative results in avoidance classes of set partitions, which were refined by Dahlberg et al. through the use of combinatorial statistics.
Grubb, Thomas, Rajasekaran, Frederick
openaire +3 more sources
Partition function of massless scalar field in Schwarzschild background [PDF]
, 2014 Using thermal value of zeta function instead of zero temperature, the partition function of quantized fields in arbitrary stationary backgrounds was found to be independent of undetermined regularization constant in even-dimension and the long drawn ...
Sanyal, Abhik Kumar
core +1 more source