Results 31 to 40 of about 125,344 (284)
Proximity Drawings of High-Degree Trees [PDF]
, 2010 A drawing of a given (abstract) tree that is a minimum spanning tree of the vertex set is considered aesthetically pleasing. However, such a drawing can only exist if the tree has maximum degree at most 6. What can be said for trees of higher degree?
Barát J. +5 more
core +1 more source
Vertex colouring edge partitions
Journal of Combinatorial Theory, Series B, 2005 Suppose that the edges of a graph are assigned labels from a \(k\)-set, or equivilently, the edges are partitioned into \(k\) parts. Each vertex \(v\) has an associated multiset \(X_v\) consisting of the labels on its incident edges. The partition is a (proper) vertex coloring if for every edge \(uv\), \(X_u \neq X_v\).
Addario-Berry, L. +3 more
openaire +2 more sources
Higher spin vertex models with domain wall boundary conditions [PDF]
, 2006 We derive determinant expressions for the partition functions of spin-k/2 vertex models on a finite square lattice with domain wall boundary conditions.Comment: 14 pages, 12 figures. Minor corrections.
A Caradoc +10 more
core +5 more sources
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
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 +2 more
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. +2 more
doaj +1 more source
Genus Two Partition and Correlation Functions for Fermionic Vertex Operator Superalgebras I [PDF]
, 2010 We define the partition and $n$-point correlation functions for a vertex operator superalgebra on a genus two Riemann surface formed by sewing two tori together.
A. Tsuchiya +30 more
core +2 more sources
THE PARTITION DIMENSION OF CYCLE BOOKS GRAPH B_(m,n) WITH A COMMON PATH P_2
BarekengSuppose 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
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
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