Results 31 to 40 of about 8,525 (305)

Vertex Set Partitions Preserving Conservativeness

Journal of Combinatorial Theory, Series B, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexander A. Ageev, Alexandr V. Kostochka   +1 more
openaire   +1 more source

On the Locating Chromatic Number of Certain Barbell Graphs

International Journal of Mathematics and Mathematical Sciences, 2018
The locating chromatic number of a graph G is defined as the cardinality of a minimum resolving partition of the vertex set V(G) such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices in G are not ...
Asmiati, I. Ketut Sadha Gunce Yana, Lyra Yulianti   +2 more
doaj   +1 more source

THE PARTITION DIMENSION OF CYCLE BOOKS GRAPH B_(m,n) WITH A COMMON PATH P_2

Barekeng
Suppose  is a connected graph with  elements of a set of vertices  denoted by  and  a subset of . The distance between  and  is the shortest distance  to every vertex  in . Let  be a partition of , where each subset  belongs to .
Jaya Santoso, Darmaji Darmaji
doaj   +1 more source

A Note on Non-Dominating Set Partitions in Graphs

Discussiones Mathematicae Graph Theory, 2016
A set S of vertices of a graph G is a dominating set if every vertex not in S is adjacent to a vertex of S and is a total dominating set if every vertex of G is adjacent to a vertex of S.
Desormeaux Wyatt J., Haynes Teresa W., Henning Michael A.   +2 more
doaj   +1 more source

Partition functions and chiral algebras.

, 2015
Conference paperWe discuss recent work of the authors concerning correlation functions and partition functions for free bosons/fermions and the b-c or ghost system.
Tuite, Michael P.
core   +1 more source

DONALDSON–THOMAS INVARIANTS OF LOCAL ELLIPTIC SURFACES VIA THE TOPOLOGICAL VERTEX

Forum of Mathematics, Sigma, 2019
We compute the Donaldson–Thomas invariants of a local elliptic surface with section. We introduce a new computational technique which is a mixture of motivic and toric methods. This allows us to write the partition function for the invariants in terms of
JIM BRYAN, MARTIJN KOOL
doaj   +1 more source

Vertex partition of hypergraphs and maximum degenerate subhypergraphs

Electronic Journal of Graph Theory and Applications, 2021
In 2007 Matamala proved that if G is a simple graph with maximum degree Δ ≥ 3 not containing KΔ+1 as a subgraph and s, t are positive integers such that s+t ≥ Δ, then the vertex set of G admits a partition (S,T) such that G[S] is a maximum order (s-1 ...
Thomas Schweser, Michael Stiebitz
doaj   +1 more source

ROBINSON-SCHENSTED CORRESPONDENCE FOR THE G-VERTEX COLORED PARTITION ALGEBRA

, 2010
In this paper, we develop the Robinson-Schensted correspondence for the G-vertex colored partition algebras, which gives the bijection between the set of G-vertex colored partition diagrams Pk(n, G) and the pairs of [Formula: see text]-vacillating ...
A. Tamilselvi
core   +1 more source

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

On some families of arbitrarily vertex decomposable spiders [PDF]

Opuscula Mathematica, 2010
A graph \(G\) of order \(n\) is called arbitrarily vertex decomposable if for each sequence \((n_1, ..., n_k)\) of positive integers such that \(\sum _{i=1}^{k} n_i = n\), there exists a partition \((V_1, ..., V_k)\) of the vertex set of \(G\) such that
Tomasz Juszczyk, Irmina A. Zioło
doaj   +1 more source