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 261
- Downloads 4
Seismic Design Considerations of Foot Bridge
A bridge is a structure providing passage over an obstacle without closing the way beneath. The required passage may be for a road, a railway, pedestrians, a canal or a pipeline. The obstacle to be crossed may be a rive...
Stochastic Model to Find the Testosterone Therapy on Functional Capacity in CHF Patients Using Stochastic Analysis
Heart failure is a serious cardiovascular condition leading to life threatening events, poor prognosis, and degradation of quality of life. According to the present evidences suggesting association between low testoster...
Blind Deconvolution Deblurring Technique In Image Processing
Image processing is an important component of modern technologies because human depends so much on the visual information than the creatures. The challenge to scientists, engineers and business people is to quickly extr...
A Review : Interference Mitigation In Mobile Body Sensor Networks
In recent time mobile body sensor network known as a capable technology having a number of applications in health and well-being. For low power sensor network, main problem in wireless body network is that it disturbs t...
A Review Paper on PSO and GA Based Optimization for Vehicle Routing Problem
The vehicle routing problem is basically originated from the truck dispatching problem. The VRP is used to design optimal set of routes to serve a given number of customers with a fleet of vehicles. The VRP plays an imp...