Results 271 to 280 of about 3,844 (297)

Partition conditions and vertex-connectivity of graphs

Combinatorica, 1981
It was proved ([5], [6]) that ifG is ann-vertex-connected graph then for any vertex sequencev 1, ...,v n ≠V(G) and for any sequence of positive integersk 1, ...,k n such thatk 1+...+k n =|V(G)|, there exists ann-partition ofV(G) such that this partition separates the verticesv 1, ...,v(n), and the class of the partition containingv i induces a ...
openaire   +2 more sources

Vertex partitioning problems on partial k-trees

1996
We describe a general approach to obtain polynomial-time algorithms over partial k-trees for graph problems in which the vertex set is to be partitioned in some way. We encode these problems with formulae of the Extended Monadic Second-order (or EMS) logic. Such a formula can be translated into a polynomial-time algorithm automatically. We focus on the
Gupta, A., Kaller, D., Mahajan, S., Shermer, T.   +3 more
openaire   +2 more sources

Refined Vertex Codes and Vertex Partitioning Methodology for Graph Isomorphism Testing

IEEE Transactions on Systems, Man, and Cybernetics, 1980
In this paper we have pursued the initial vertex partioning methodology for a graph (digraph) isomorphism testing problem using lexicographic ordering of vertex codes. The newly introduced vertex codes (which may be of fixed length or of variable length) incorporate order independent parameters of a graph in relation to a vertex and can be computed ...
openaire   +2 more sources

A Graph Partitioning Algorithm for Edge or Vertex Balance

2020
The definition of effective strategies for graph partitioning is a major challenge in distributed environments since an effective graph partitioning allows to considerably improve the performance of large graph data analytics computations. In this paper, we propose a multi-objective and scalable Balanced GRAph Partitioning (B-GRAP) algorithm to produce
Adnan El Moussawi, Nacéra Bennacer Seghouani, Francesca Bugiotti   +2 more
openaire   +1 more source

Partition Function of the Eight-Vertex Lattice Model

Annals of Physics, 1972
The partition function of the zero-field “Eight-Vertex” model on a square M by N lattice is calculated exactly in the limit of M, N large. This model includes the dimer, ice and zero-field Ising, F and KDP models as special cases. In general the free energy has a branch point singularity at a phase transition, with an irrational exponent.
openaire   +2 more sources

Optimal Vertex Partitions

Bulletin of the London Mathematical Society, 1979
Bollobas, Bela, Manvel, Bennet
openaire   +2 more sources

The Five-Vertex Model and Enumerations of Plane Partitions

Journal of Mathematical Sciences, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A VERTEX PARTITIONING OF A GRAPH

Proceedings of the Third Asian Mathematical Conference 2000, 2002
SERGIO R. CANOY, ESPERANZA B. ARUGAY, ESAMEL M. PALUGA   +2 more
openaire   +1 more source

Finding the edge ranking number through vertex partitions

Discrete Applied Mathematics, 2013
Justie Su-Tzu Juan, Yue-Li Wang
exaly  

An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs

Journal of Graph Theory, 2013
Gabor N Sarkozy, Stanley M Selkow, Fei Song   +2 more
exaly