Tree partitioning via vertex deletion
Electronic Notes in Discrete Mathematics, 2001 Abstract Motivated by tree partitioning problems, we introduce the notion of i-divider of a tree, t -dividers generalize concepts well-known in literature, such as centroids and separators, that are the backbone of tree decomposition algorithms based on vertex deletion.
FINOCCHI, Irene, PETRESCHI, Rossella
openaire +3 more sources
Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set [PDF]
Opuscula MathematicaA graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. We give constructions that yield infinite families of graphs that are TI-graphs, as well as constructions that yield ...
Teresa W. Haynes, Michael A. Henning
doaj +1 more source
Vertex Set Partitions Preserving Conservativeness
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ageev, A.A., Kostochka, A.V.
openaire +1 more source
Augmenting graphs to partition their vertices into a total dominating set and an independent dominating set [PDF]
Opuscula MathematicaA graph \(G\) whose vertex set can be partitioned into a total dominating set and an independent dominating set is called a TI-graph. There exist infinite families of graphs that are not TI-graphs. We define the TI-augmentation number \(\operatorname{ti}(
Teresa W. Haynes, Michael A. Henning
doaj +1 more source
Partitions of networks that are robust to vertex permutation dynamics
Special Matrices, 2015 Minimum disconnecting cuts of connected graphs provide fundamental information about the connectivity structure of the graph. Spectral methods are well-known as stable and efficient means of finding good solutions to the balanced minimum cut problem.
Froyland Gary, Kwok Eric
doaj +1 more source
Towards Yang-Baxter integrability of quantum crystal melting: From Kagome lattice to vertex models
Nuclear Physics B, 2021 This paper considers aspects of a Kagome lattice system with states classified by plane partitions. Using two sets of free fermions, we rewrite the lattice in terms of two families of spin chains.
Thiago Araujo
doaj +1 more source
Perfect 2-colorings of the cubic graphs of order less than or equal to 10
AKCE International Journal of Graphs and Combinatorics, 2020 Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte. A perfect -coloring of a graph with colors is a partition of the vertex set of into m parts , . . .
Mehdi Alaeiyan, Ayoob Mehrabani
doaj +1 more source
Refined Topological Vertex, Cylindric Partitions and the U(1) Adjoint Theory [PDF]
, 2009 We study the partition function of the compactified 5D U(1) gauge theory (in the Omega-background) with a single adjoint hypermultiplet, calculated using the refined topological vertex.
Aganagic +24 more
core +2 more sources
Square Property, Equitable Partitions, and Product-like Graphs [PDF]
, 2013 Equivalence relations on the edge set of a graph $G$ that satisfy restrictive conditions on chordless squares play a crucial role in the theory of Cartesian graph products and graph bundles.
Hellmuth, Marc +2 more
core +1 more source
Vertex Separators for Partitioning a Graph [PDF]
Sensors, 2008 Finite Element Method (FEM) is a well known technique extensively studiedfor spatial and temporal modeling of environmental processes, weather predictioncomputations, and intelligent signal processing for wireless sensors. The need for hugecomputational power arising in such applications to simulate physical phenomenoncorrectly mandates the use of ...
openaire +3 more sources