Results 21 to 30 of about 3,844 (297)
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
Cutwidth Bounds via Vertex Partitions
CoRR14 pages including appendix.
Antoine Amarilli, Benoît Groz
core +4 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
Accelerate Incremental TSP Algorithms on Time Evolving Graphs with Partitioning Methods
Algorithms, 2022 In time-evolving graphs, the graph changes at each time interval, and the previously computed results become invalid. We addressed this issue for the traveling salesman problem (TSP) in our previous work and proposed an incremental algorithm where the ...
Shalini Sharma, Jerry Chou
doaj +1 more source
Distance Domination in Vertex Partitioned Graphs
Mathematica Pannonica, 2022 We treat a variation of graph domination which involves a partition (V 1, V 2,..., Vk) of the vertex set of a graph G and domination of each partition class V i over distance d where all vertices and edges of G may be used in the domination process. Strict upper bounds and extremal graphs are presented; the results are collected in three handy tables ...
Frendrup, Allan +2 more
openaire +2 more sources
Vertex sparsifiers : new results from old techniques [PDF]
, 2014 Given a capacitated graph $G = (V,E)$ and a set of terminals $K \subseteq V$, how should we produce a graph $H$ only on the terminals $K$ so that every (multicommodity) flow between the terminals in $G$ could be supported in $H$ with low congestion, and ...
Gupta, Anupam +10 more
core +1 more source