Results 21 to 30 of about 35,638 (292)
$\mathcal{B}$-Partitions, determinant and permanent of graphs [PDF]
Transactions on Combinatorics, 2018 Let $G$ be a graph (directed or undirected) having $k$ number of blocks $B_1, B_2,\hdots,B_k$. A $\mathcal{B}$-partition of $G$ is a partition consists of $k$ vertex-disjoint subgraph $(\hat{B_1},\hat{B_1},\hdots,\hat{B_k})$ such that $\hat{B}_i$ is an ...
Ranveer Singh, Ravindra Bapat
doaj +1 more source
Partition Dimension of Generalized Petersen Graph
Complexity, 2021 Let G=VG,EG be the connected graph. For any vertex i∈VG and a subset B⊆VG, the distance between i and B is di;B=mindi,j|j∈B. The ordered k-partition of VG is Π=B1,B2,…,Bk. The representation of vertex i with respect to Π is the k-vector, that is, ri|Π=di,
Hassan Raza +3 more
doaj +1 more source
Star compressed zero divisors graph and partitions of vector spaces [PDF]
ریاضی و جامعه, 2023 Let $R$ be a commutaive ring and $Zd(R)$ be the set of zero divisors of $R$. Define an equivalence relation $\sim$ on $Zd(R)$ as follows: $x\sim y$ if and only if $ann(x)=ann(y)$.
Hamid Reza Dorbidi
doaj +1 more source
Extremal optimization for graph partitioning [PDF]
Physical Review E, 2001 34 pages, RevTex4, 1 table and 20 ps-figures included, related papers available at http://www.physics.emory.edu/faculty/boettcher/
Boettcher, S., Percus, A. G.
openaire +3 more sources
On bounded partition dimension of different families of convex polytopes with pendant edges
AIMS Mathematics, 2022 Let $ \psi = (V, E) $ be a simple connected graph. The distance between $ \rho_1, \rho_2\in V(\psi) $ is the length of a shortest path between $ \rho_1 $ and $ \rho_2.
Adnan Khali +2 more
doaj +1 more source
The Foliage Partition: An Easy-to-Compute LC-Invariant for Graph States [PDF]
QuantumThis paper introduces the foliage partition, an easy-to-compute LC-invariant for graph states, of computational complexity $\mathcal{O}(n^3)$ in the number of qubits.
Adam Burchardt, Frederik Hahn
doaj +1 more source
Dimensi Partisi pada Graf Hasil Operasi Korona Tingkat-k
Contemporary Mathematics and Applications (ConMathA)Graph theory is one of the subjects in Discrete Mathematics that have long been known and are widely applied in various fields. The topics that are often discussed in graph theory include labeling, coloring, chromatic numbers, metric dimensions, and ...
Rica Amalia +4 more
doaj +1 more source
THE PARTITION DIMENSION OF CYCLE BOOKS GRAPH B_(m,n) WITH A COMMON PATH P_2
BarekengSuppose is a connected graph with elements of a set of vertices denoted by and a subset of . The distance between and is the shortest distance to every vertex in . Let be a partition of , where each subset belongs to .
Jaya Santoso, Darmaji Darmaji
doaj +1 more source
Partitioned Probe Comparability Graphs
Theoretical Computer Science, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chandler, David B. +4 more
openaire +1 more source
SIAM Journal on Discrete MathematicsGiven a finite set of points in $\mathbb{R}^d$, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given set of points, whose edges describe closeness between different Tverberg partitions. We prove bounds on the minimum
Deborah Oliveros +3 more
openaire +3 more sources