The bounds of crossing number in complete bipartite graphs
Journal Title: International Journal for Research in Applied Science and Engineering Technology (IJRASET) - Year 2015, Vol 3, Issue 5
Abstract
We compare the lower bound of crossing number of bipartite and complete bipartite graph with Zarankiewicz conjecture and we illustrate the possible upper bound by a modified Zarankiewicz conjecture.
Authors and Affiliations
M. Malathi, Dr. J. Ravi Sankar, Dr. N. Selvi
Keywords
Related Articles
- EP ID EP20584
- DOI -
- Views 265
- Downloads 4
Web content filtering for Educational & Business Organization: A Review
In the recent years, we have witnessed an impressive growth of on-line information and resources. The selfregulating nature of Web publishing, along with the ease of making information available on the Web, has allowed t...
Water Monitoring System for Hydroponics Agriculture
Hydroponics is a concept which is a part of hydro culture and is a method of growing plants in water , without soil using only the mineral nutrient solutions. The nutrients in hydroponics system can be from fish waste,...
Efficient Multi Review Classification using feature extraction technique in the Micro Reviews
Although the content of micro-blogging sites has been studied extensively, micro-reviews are a source of content that has been largely overlooked in the literature. In this paper we study micro-reviews, and we show how...
Overview on the Methods of Preparation of Nano Particles
Nanoparticles are particles between 1 to 100nm in size. Nanotechnology is an interdisciplinary and crossing-over technology. The most important thing is observing and characterizing the phenomena showing in the nanotech...
Performance of RC Frame With and Without Bracing Pushover Analysis
Now a days an earthquakes are more affected on concrete structures have been severely damaged or collapsed. So there is a need of to evaluate the seismic adequacy. We can’t avoid the future earthquakes but we can manage...