Results 31 to 40 of about 345,858 (279)

On The Partition Dimension of Disconnected Graphs

Journal of Mathematical and Fundamental Sciences, 2017
For a graph G=(V,E), a partition Ω=\{O_1,O_2,…,O_k \} of the vertex set V is called a resolving partition if every pair of vertices u,v∈V(G) have distinct representations under Ω.
Debi Oktia Haryeni, Edy Tri Baskoro , Suhadi Wido Saputro   +2 more
doaj   +1 more source

On the Bounded Partition Dimension of Some Generalised Graph Structures

Journal of Mathematics, 2022
Consider λ to be a connected graph with a vertex set Vλ that may be partitioned into any partition set S. If each vertex in λ has a separate representation with regard to S and is an ordered k partition, then the set with S is a resolving partition of λ..
Wajdi Alghamdi, Muhammad Ahsan Asim
doaj   +1 more source

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

Rotating Higher Spin Partition Functions and Extended BMS Symmetries [PDF]

, 2016
We evaluate one-loop partition functions of higher-spin fields in thermal flat space with angular potentials; this computation is performed in arbitrary space-time dimension, and the result is a simple combination of Poincar\'e characters.
A Ashtekar, A Bagchi, A Bagchi, A Campoleoni, A Campoleoni, A Campoleoni, A Campoleoni, A Campoleoni, A Campoleoni, A Sagnotti, A. Campoleoni, AA Tseytlin, B Oblak, B. Oblak, BA Khesin, C Fronsdal, D Grumiller, DV Vassilevich, E İnönü, E Witten, EP Wigner, FA Dolan, G Barnich, G Barnich, G Barnich, G Barnich, G Barnich, G Barnich, GW Gibbons, GW Mackey, GW Mackey, H Afshar, H Joos, H. A. Gonzalez, HA Gonzalez, HX Nghiem, I Mandal, IR Klebanov, J Balog, J Balog, J Dai, J Fang, JD Brown, JR David, LPS Singh, LPS Singh, M Beccaria, M Beccaria, M Beccaria, M Henneaux, M. Riegler, MA Vasiliev, MP Blencowe, MR Gaberdiel, MR Gaberdiel, MR Gaberdiel, MR Gaberdiel, O Coussaert, O Fuentealba, O Fuentealba, P Bouwknegt, P Schuster, P Schuster, R Gopakumar, RK Gupta, RR Metsaev, S Giombi, S Giombi, S Giombi, S Giombi, T Basile, T Creutzig, W Fulton, X Bekaert, Z Bajnok   +74 more
core   +4 more sources

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

On Partition Dimension of Some Cycle-Related Graphs [PDF]

Mathematical Problems in Engineering, 2021
Let G be a simple connected graph. Suppose Δ = Δ
Changcheng Wei, Muhammad Faisal Nadeem, Hafiz Muhammad Afzal Siddiqui, Muhammad Azeem, Jia-Bao Liu, Adnan Khalil   +5 more
openaire   +2 more sources

Crystal melting on toric surfaces [PDF]

, 2009
We study the relationship between the statistical mechanics of crystal melting and instanton counting in N=4 supersymmetric U(1) gauge theory on toric surfaces. We argue that, in contrast to their six-dimensional cousins, the two problems are related but
Aganagic, Amir-Kian Kashani-Poor, Atiyah, Bonelli, Bott, Cirafici, Dijkgraaf, Dijkgraaf, Donaldson, Dürr, Edidin, Eisenbud, Ellingsrud, Fogarty, Fucito, Fulton, Griffiths, Griguolo, Göttsche, Harris, Hartshorne, Hartshorne, Iqbal, Kronheimer, Li, Losev, Martin-Deschamps, Maulik, Michele Cirafici, Nakajima, Nekrasov, Nekrasov, Okonek, Okounkov, Richard J. Szabo, Vafa   +35 more
core   +1 more source

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, Edy Tri Baskoro, Suhadi Wido Saputro   +2 more
doaj   +1 more source

Partition dimension of projective planes

European Journal of Combinatorics, 2017
11 ...
Blázsik, Zoltán, Nagy, Zoltán Lóránt   +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