Search
Search Results
-
SDP-based bounds for graph partition via extended ADMM
We study two NP-complete graph partition problems, k -equipartition problems and graph partition problems with knapsack constraints (GPKC). We...
-
The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions
The utility of a matrix satisfying the Strong Spectral Property has been well established particularly in connection with the inverse eigenvalue...
-
Perfect state transfer, equitable partition and continuous-time quantum walk based search
In this paper, we consider a continuous-time quantum walk based search algorithm. We discuss equitable partition of the graph and perfect state...
-
-
Partitioning planar graph of girth 5 into two forests with maximum degree 4
Given a graph G = ( V, E ), if we can partition the vertex set V into two nonempty subsets V 1 and V 2 which satisfy Δ( G [ V 1 ]) ⩽ d 1 and Δ( G [ V 2 ]) ⩽ d 2 ,...
-
Exact Vertex Migration Model of Graph Partitioning Based on Mixed 0–1 Linear Programming and Iteration Algorithm
Graph partitioning problem is a classical NP-hard problem. The improvement of graph partitioning results by vertex migration is an important class of...
-
-
Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm
Graph partitioning is a classical NP problem. The goal of graphing partition is to have as few cut edges in the graph as possible. Meanwhile, the...
-
Odd Chromatic Number of Graph Classes
A graph is called odd (respectively, even) if every vertex has odd (respectively, even) degree. Gallai proved that every graph can be partitioned... -
Factorisation of the Complete Bipartite Graph into Spanning Semiregular Factors
We enumerate factorisations of the complete bipartite graph into spanning semiregular graphs in several cases, including when the degrees of all the...
-
A 2-Bisection with Small Number of Monochromatic Edges of a Claw-Free Cubic Graph
A bisection of a graph G is a partition of its vertex set into two parts of the same cardinality. A k -bisection of G is a bisection of G such that...
-
Defining an Affine Partition Algebra
We define an affine partition algebra by generators and relations and prove a variety of basic results regarding this new algebra analogous to those...
-
-
A partition statistic for partitions with even parts distinct
Andrews, Hirschhorn, and Sellers studied the partition function ped ( n ) which enumerates the number of partitions of n with even parts distinct, and...
-
Schmidt-type theorems via weighted partition identities
A 1999 theorem of F. Schmidt states that the number of partitions into distinct parts such that the odd indexed parts sum to n , is equal to the...
-
Graph coloring and semidefinite rank
This paper considers the interplay between semidefinite programming, matrix rank, and graph coloring. Karger et al. (J ACM 45(2):246–265, 1998) give...