Results 21 to 30 of about 293,400 (267)
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
Parallel Graph Partitioning for Complex Networks [PDF]
, 2015 Processing large complex networks like social networks or web graphs has recently attracted considerable interest. In order to do this in parallel, we need to partition them into pieces of about equal size.
Meyerhenke, Henning +2 more
core +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
On the exact learnability of graph parameters: The case of partition functions [PDF]
, 2016 We study the exact learnability of real valued graph parameters $f$ which are known to be representable as partition functions which count the number of weighted homomorphisms into a graph $H$ with vertex weights $\alpha$ and edge weights $\beta$.
Labai, Nadia, Makowsky, Johann A.
core +2 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
Streaming Graph Challenge: Stochastic Block Partition
, 2017 An important objective for analyzing real-world graphs is to achieve scalable performance on large, streaming graphs. A challenging and relevant example is the graph partition problem.
Gadepally, Vijay +11 more
core +1 more source
A graph partition problem [PDF]
, 2014 Given a graph $G$ on $n$ vertices, for which $m$ is it possible to partition the edge set of the $m$-fold complete graph $mK_n$ into copies of $G$? We show that there is an integer $m_0$, which we call the \emph{partition modulus of $G$}, such that the ...
Cameron, Peter J., Cioabă, Sebastian M.
core +2 more sources