Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
315,164
INTRINSIC KNOTTING OF PARTITE GRAPHS
"... Abstract. We introduce theorems that identify partite graphs that are in-trinsically knotted (IK) since they contain subgraphs that are intrinsically knotted. We show that if we increase the number of vertices in each of the parts except one and delete an edge of an intrinsically knotted graph of tw ..."
Abstract
- Add to MetaCart
Abstract. We introduce theorems that identify partite graphs that are in-trinsically knotted (IK) since they contain subgraphs that are intrinsically knotted. We show that if we increase the number of vertices in each of the parts except one and delete an edge of an intrinsically knotted graph
ON INTEGRAL COMPLETE R−PARTITE GRAPHS
"... AgraphG is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper we investigate integral complete r−partite graphs Kp1,p2,...,pr = Ka1p1,a2p2,...,asps with s ≤ 4. New sufficient conditions for complete 3-partite graphs and complete 4-partite graphs to be integral ..."
Abstract
- Add to MetaCart
AgraphG is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper we investigate integral complete r−partite graphs Kp1,p2,...,pr = Ka1p1,a2p2,...,asps with s ≤ 4. New sufficient conditions for complete 3-partite graphs and complete 4-partite graphs
Unsupervised Learning on K-partite Graphs
, 2006
"... Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the research on mining the hidden structures from a k-partite graph is still limited and preliminary. In this paper, we propose a g ..."
Abstract
-
Cited by 46 (4 self)
- Add to MetaCart
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the research on mining the hidden structures from a k-partite graph is still limited and preliminary. In this paper, we propose a
INTRINSIC LINKING OF COMPLETE PARTITE GRAPHS
, 2003
"... Abstract. We classify complete partite graphs with respect to intrinsic linking. In Adams’s The Knot Book, it is conjectured that on removing a vertex from an intrinsically knotted graph, one obtains an intrinsically linked graph. We verify this conjecture for the class of complete partite graphs. 1 ..."
Abstract
- Add to MetaCart
Abstract. We classify complete partite graphs with respect to intrinsic linking. In Adams’s The Knot Book, it is conjectured that on removing a vertex from an intrinsically knotted graph, one obtains an intrinsically linked graph. We verify this conjecture for the class of complete partite graphs
Partitioning Graphs into Balanced Components
, 2009
"... We consider the k-balanced partitioning problem, where the goal is to partition the vertices of an input graph G into k equally sized components, while minimizing the total weight of the edges connecting different components. We allow k to be part of the input and denote the cardinality of the verte ..."
Abstract
-
Cited by 18 (2 self)
- Add to MetaCart
We consider the k-balanced partitioning problem, where the goal is to partition the vertices of an input graph G into k equally sized components, while minimizing the total weight of the edges connecting different components. We allow k to be part of the input and denote the cardinality
On Decomposing 4-partite Graphs Into Triangles
, 1993
"... We prove that for a 4-partite graph of order n with b n 2 4 c + k edges, there exists an edge-disjoint collection of at least k \Gamma O(n) triangles. ..."
Abstract
- Add to MetaCart
We prove that for a 4-partite graph of order n with b n 2 4 c + k edges, there exists an edge-disjoint collection of at least k \Gamma O(n) triangles.
Domination in Partitioned Graphs
"... Let V 1 ; V 2 be a partition of the vertex set in a graph G, let denote the domination number of G and let i denote the least number of vertices needed in G to dominate V i . We prove that 1 + 2 4 5 jV (G)j for any graph without isolated vertices or edges, and that equality occurs precisely if G con ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
Let V 1 ; V 2 be a partition of the vertex set in a graph G, let denote the domination number of G and let i denote the least number of vertices needed in G to dominate V i . We prove that 1 + 2 4 5 jV (G)j for any graph without isolated vertices or edges, and that equality occurs precisely if G
Partitioning Graphs of Regular Degree
"... Graph-Partitioning problems occur in a wide range of applications. The task is to divide the vertices of a graph in equally sized parts such that as few edges as possible are crossing the boundaries. The calculation of an optimal result is NP-complete. We show a new strategy to derive upper bounds o ..."
Abstract
- Add to MetaCart
Graph-Partitioning problems occur in a wide range of applications. The task is to divide the vertices of a graph in equally sized parts such that as few edges as possible are crossing the boundaries. The calculation of an optimal result is NP-complete. We show a new strategy to derive upper bounds
Results 1 - 10
of
315,164
