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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arora, S., Karger, D.R., Karpinski, M.: Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems. J. Comput. Syst. Sci. 58, 193–210 (1999)
Bell, S.B.M., Holroyd, F.C., Mason, D.C.: A Digital Geometry for Hexagonal Pixels. Image and Vision Computing 7, 194–204 (1989)
Czumaj, A., Sohler, C.: Testing Hypergraph Colorability. Theoretical Computer Science 331, 37–52 (2005)
Evrendilek, C.: Vertex Separators for Partitioning a Graph. Sensors 8, 635–657 (2008)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)
Jakovac, M., Klavazar, S.: Vertex-, Edge-, and Total-Colorings of Sierpinski-like Graphs. Discrete Mathematics 309(6), 1548–1556 (2009)
Klavzar, S.: Coloring Sierpinski Graphs and Sierpinski Gasket Graphs. Taiwanese J. Math. 12, 513–522 (2008)
Manuel, P., Rajasingh, I., Rajan, B., Muthumalai, A.: On Induced Matching Partitions of Certain Interconnection Networks. In: FCS, pp. 57–63 (2006)
Schaefer, T.J.: The Complexity of Satisfiability Problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, pp. 216–226 (1976)
Stojmenovic, I.: Honeycomb Networks: Topological Properties and Communication Algorithms. IEEE Transactions on Parallel and Distributed Systems 8(10), 1036–1042 (1997)
Tajozzakerin, H.R., Sarbazi-Azad, H.: Enhanced-Star: A New Topology Based on the Star Graph. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds.) ISPA 2004. LNCS, vol. 3358, pp. 1030–1038. Springer, Heidelberg (2004)
Teguia, A.M., Godbole, A.P.: Sierpinski Gasket Graphs and Some of their Properties. Australasian Journal of Combinatorics 35, 181 (2006)
Xu, J.: Topological Structure and Analysis of Interconnection Networks. Kluwer Academic Publishers (2001)
Yuan, J., Wang, Q.: Partition the Vertices of a Graph into Induced Matching. Discrete Mathematics 263, 323–329 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rajasingh, I., Rajan, B., Shanthi, A.S., Muthumalai, A. (2011). Induced Matching Partition of Sierpinski and Honeycomb Networks. In: Abd Manaf, A., Sahibuddin, S., Ahmad, R., Mohd Daud, S., El-Qawasmeh, E. (eds) Informatics Engineering and Information Science. ICIEIS 2011. Communications in Computer and Information Science, vol 253. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25462-8_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-25462-8_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25461-1
Online ISBN: 978-3-642-25462-8
eBook Packages: Computer ScienceComputer Science (R0)