Results 41 to 50 of about 3,844 (297)

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

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

Partition dimension of trees - palm approach

Electronic Journal of Graph Theory and Applications
The 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

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

Embedding the dual complex of hyper-rectangular partitions

Journal of Computational Geometry, 2013
A rectangular partition is the partition of an (axis-aligned) rectangle into interior-disjoint rectangles. We ask whether a rectangular partition permits a nice drawing of its dual, that is, a straight-line embedding of it such that each dual vertex is ...
Michael Kerber
doaj   +1 more source

Coherent network partitions

, 2021
We continue to study coherent partitions of graphs whereby the vertex set is partitioned into subsets that induce biclique spanned subgraphs. The problem of identifying the minimum number of edges to obtain biclique spanned connected components (CNP ...
Omranian, Sara (Dr.), Nikoloski, Zoran (Prof. Dr.), Angeleska, Angela   +2 more
core   +1 more source

On the b-Domatic Number of Graphs

Discussiones Mathematicae Graph Theory, 2019
A set of vertices S in a graph G = (V, E) is a dominating set if every vertex not in S is adjacent to at least one vertex in S. A domatic partition of graph G is a partition of its vertex-set V into dominating sets. A domatic partition 𝒫 of G is called b-
Benatallah Mohammed, Ikhlef-Eschouf Noureddine, Mihoubi Miloud   +2 more
doaj   +1 more source

Three types of dual Grothendieck universal characters and integrable systems

Nuclear Physics B
We construct vertex operator realizations of the π-type dual Grothendieck universal characters with partitions π=(3),π=(2,1) and π=(13). Furthermore, these three types of dual Grothendieck universal characters are extended to their multiparameter ...
Jinzhou Liu, Denghui Li, Zhaowen Yan
doaj   +1 more source

Experimental Evaluation of 100Cr6 Steel Microindented Surfaces Under Lubricated Nonconformal Point Contacts

Advanced Engineering Materials, EarlyView.
The tribological behavior of 100Cr6 steel spheres textured via Vickers microindentation is evaluated under lubricated sliding by varying both dimple size and density. Fine and dense textures significantly reduce friction across all lubrication regimes, while large dimples increase it.
Farideh Davoodi, Pasquale Guglielmi, Gianfranco Palumbo, Giuseppe Carbone   +3 more
wiley   +1 more source

A Set Partition Analog of the Erd os-Szekeres Theorem [PDF]

, 2013
Permission to publish this work was granted by the author. The paper was submitted to the Archives on CD.The monotonic subsequence problem has been studied in depth.
Liu, Rui
core