Header menu link for other important links
X
Induced matching partition of sierpinski and honeycomb networks
, B. Rajan, A.S. Shanthi, A. Muthumalai
Published in
2011
Volume: 253 CCIS
   
Issue: PART 3
Pages: 390 - 399
Abstract
Graph partitioning has several important applications in Computer Science, including VLSI circuit layout, image processing, solving sparse linear systems, computing fill-reducing orderings for sparse matrices, and distributing workloads for parallel computation. In this paper we have determined the induced matching partition number for certain classes of bipartite graphs, sierpinski graphs, sierpinski gaskets, honeycomb tori and honeycomb networks. © 2011 Springer-Verlag.
About the journal
JournalCommunications in Computer and Information Science
ISSN18650929