Journal ArticleDOI
Induced H-packing k-partition of graphs
S. Maria Jesu Raja,Indra Rajasingh,Antony Xavier +2 more
- Vol. 6, Iss: 2, pp 143-158
Reads0
Chats0
TLDR
The induced -packing k-partition number is obtained for trees, slim trees, split graphs, complete bipartite graphs, grids and circulant graphs, and it is proved that an induced - packing k- partition problem is NP-Complete.Abstract:
The minimum induced H-packing k-partition number is denoted by i p p H ( G , H ) . The induced H-packing k-partition number denoted by i p p ( G , H ) is defined as i p p ( G , H ) = m i n i p p H ...read more
References
More filters
Book
Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes
TL;DR: This chapter discusses sorting on a Linear Array with a Systolic and Semisystolic Model of Computation, which automates the very labor-intensive and therefore time-heavy and expensive process of manually sorting arrays.
Book
Topological Structure and Analysis of Interconnection Networks
TL;DR: This book provides the most basic problems, concepts, and well-established results from the topological structure and analysis of interconnection networks in the graph-theoretic language for undergraduates and postgraduates specializing in computer science and applied mathematics.
Journal ArticleDOI
A survey of the theory of hypercube graphs
TL;DR: A comprehensive survey of the theory of hypercube graphs can be found in this paper, where basic properties related to distance, coloring, domination and genus are reviewed, including thickness, coarseness, Hamiltonian cycles and induced paths.
Journal ArticleDOI
On induced matchings
Angelika Steger,Min-Li Yu +1 more
TL;DR: An affirmative answer is given for d=3, the first nontrivial case of this conjecture that q ∗ (G)⩽d 2 , if G is a bipartite graph and d is the maximum degree of G.
Journal ArticleDOI
The locally twisted cubes
TL;DR: A simple routing algorithm is developed for LTQ n, which creates a shortest path from the source to the destination in O(n) time, and it is shown thatLTQ n consists of two disjoint copies of Q n −1 by adding a matching between their nodes.