Results 251 to 260 of about 55,995 (279)

Transversals of Vertex Partitions in Graphs

SIAM Journal on Discrete Mathematics, 1990
This paper studies a number of graph-theoretic parameters that are defined by statements of the form: For every partition of the vertex set that satisfies an upper (or lower) bound on the number of elements in each partition class, there is a transveral of the partition that is an independent (or dominating) set.
openaire   +1 more source

Vertex Partitions of K4,4-Minor Free Graphs

Graphs and Combinatorics, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Efficient graph automorphism by vertex partitioning

Artificial Intelligence, 1983
We describe a vertex partitioning method and squeeze tree search technique, which can be used to determine the automorphism partition of a graph in polynomial time for all graphs tested, including those which are strongly regular. The vertex partitioning procedure is based on first transforming the graph by the 1-or 2-subdivision transform or the 1-or ...
Fowler, G., Haralick, R., Gray, F. G., Feustel, C., Grinstead, Charles M.   +4 more
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

A rooted-forest partition with uniform vertex demand

Journal of Combinatorial Optimization, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katoh, Naoki, Tanigawa, Shin-ichi
openaire   +1 more source

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

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

Partitioning a graph into vertex-disjoint paths

Studia Scientiarum Mathematicarum Hungarica, 2005
Let G=(V,E) be a simple graph of order n. We consider the problem of partitioning G into vertex-disjoint paths. We obtain the following new results: (i) For any positive integer k, if dG(x)+dG(y) = n-k-1 for every pair x, y of nonadjacent vertices in  G, then G can be partitioned into k vertex-disjoint paths, unless G belongs to certain classes of ...
Jianping Li, George Steiner
openaire   +1 more source

Optimal Vertex Partitions

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

Exploiting Vertex-Cut Partitioning in Distributed Graph Generation

Graphs sub-structures have strong influence on the characteristics of real-world complex networks. Moreover, graph generation algorithms must capture and replicate these characteristics to remain representative of their real-world counterparts. The ever-increasing size of data collected from observed networks introduces another layer of complexity ...
Atas, Furkan, Akgun, Mehmet Burak
openaire   +2 more sources