Results 31 to 40 of about 3,864 (298)
Acyclic, Star and Oriented Colourings of Graph Subdivisions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Let G be a graph with chromatic number χ(G). A vertex colouring of G is acyclic if each bichromatic subgraph is a forest. A star colouring of G is an acyclic colouring in which each bichromatic subgraph is a star forest. Let χ a (G) and χ s (G)
David R. Wood
doaj +2 more sources
Topological properties of the functional and vertex type-driven network partitions. [PDF]
, 2019 The functional partitions are denoted by the respective modules, metabolic domain (MD), regulatory domain (RD) and protein interface (PI). The vertex type-driven partitions are represented by the comprising vertex types, reaction (green hexagon ...
Anne Grimbs (6663983) +3 more
core +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
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
Brick partitions of graphs [PDF]
, 2010 For each rational number q=b/c where b≥c are positive integers, we define a q-brick of G to be a maximal subgraph H of G such that cH has b edge-disjoint spanning trees, and a q-superbrick of G to be a maximal subgraph H of G such that cH−e has b edge ...
Jackson, Bill, Jordán, Tibor
core +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
Partition dimension of trees - palm approach
Electronic Journal of Graph Theory and ApplicationsThe partition dimension of a graph is the minimum number of vertex partitions such that every vertex has different distances to the ordered partitions. Many resolving partitions for trees have all vertices not in an end-path in the same partition.
Yusuf Hafidh, Edy Tri Baskoro
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
Finding the edge ranking number through vertex partitions [PDF]
, 2020 [[abstract]]An edge coloring c': E -> {1, 2,..., t} of a graph G = (V, E) is an edge t-ranking if for any two edges of the same color, every path between them contains an intermediate edge with a larger color.
Lin, YL
core +2 more sources
The B-Domatic Number of a Graph
Discussiones Mathematicae Graph Theory, 2013 Besides the classical chromatic and achromatic numbers of a graph related to minimum or minimal vertex partitions into independent sets, the b-chromatic number was introduced in 1998 thanks to an alternative definition of the minimality of such ...
Favaron Odile
doaj +1 more source