Results 1 to 10 of about 3,864 (298)
A social network graph partitioning algorithm based on double deep Q-Network [PDF]
Scientific ReportsWith the rapid expansion of social networks, efficiently mining and analyzing massive graph data has become a fundamental challenge in social network research. Graph partitioning plays a pivotal role in enhancing the performance of such analyses. However,
Jie Cao +4 more
doaj +2 more sources
On the activities and partitions of the vertex subsets of graphs [PDF]
Enumerative Combinatorics and Applications, 2021 Crapo introduced a construction of interval partitions of the Boolean lattice for sets equipped with matroid structure. This construction, in the context of graphic matroids, is related to the notion of edge activities introduced by Tutte. This implies that each spanning subgraph of a connected graph can be constructed from edges of exactly one ...
Kristina Dedndreaj, Peter Tittmann
doaj +4 more sources
Vertex partitions of chordal graphs [PDF]
Journal of Graph Theory, 2006 AbstractA k‐tree is a chordal graph with no (k + 2)‐clique. An ℓ‐tree‐partition of a graph G is a vertex partition of G into ‘bags,’ such that contracting each bag to a single vertex gives an ℓ‐tree (after deleting loops and replacing parallel edges by a single edge).
David Wood
exaly +3 more sources
Vertex colouring edge partitions
Journal of Combinatorial Theory Series B, 2005 Suppose that the edges of a graph are assigned labels from a \(k\)-set, or equivilently, the edges are partitioned into \(k\) parts. Each vertex \(v\) has an associated multiset \(X_v\) consisting of the labels on its incident edges. The partition is a (proper) vertex coloring if for every edge \(uv\), \(X_u \neq X_v\).
R E L Aldred
exaly +3 more sources
Vertex Partitions of Hypercubes into Symmetric Snakes
Electronic Notes in Discrete Mathematics, 2002 Abstract In his paper (Combinatorica 14 (4) (1994), 491-496) Wojciechowski constructed a snake S, i.e. an induces cycle, in the n-dimensional hypercube Qn such that for some subgroup G of the automorphism group of Qn, of order at most 16, the G-translates of S partition the vertex set of Qn.
Agung Lukito, A. J. van Zanten
exaly +2 more sources
Some topological indices of pentagonal double chains [PDF]
ITM Web of Conferences, 2022 In graph theory, lattices are used when some structural part of the graph repeats itself finitely or infinitely many times. They have applications in complex analysis and geometry in mathematics, and also natural applications in chemical graph theory. As
Mahalank Pushpalatha +4 more
doaj +1 more source
Nullspace vertex partition in graphs [PDF]
Journal of Combinatorial Optimization, 2020 17 pages 6 ...
Irene Sciriha +2 more
openaire +3 more sources
Ordered Vertex Partitioning [PDF]
Discrete Mathematics & Theoretical Computer Science, 2000 A transitive orientation of a graph is an orientation of the edges that produces a transitive digraph. The modular decomposition of a graph is a canonical representation of all of its modules. Finding a transitive orientation and finding the modular decomposition are in some sense dual problems.
Ross M. McConnell, Jeremy P. Spinrad
openaire +5 more sources
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
$k$-Efficient partitions of graphs [PDF]
Communications in Combinatorics and Optimization, 2019 A set $S = \{u_1,u_2, \ldots, u_t\}$ of vertices of $G$ is an efficient dominating set if every vertex of $G$ is dominated exactly once by the vertices of $S$.
M. Chellali +2 more
doaj +1 more source