Open AccessA Study on Slope Number of Certain Classes of Bipartite Graphs
Author(s) -
Arnaud Mary,
A. Amutha,
M. Selvi
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i4.10.21036
Subject(s) - bipartite graph , combinatorics , line graph , cograph , discrete mathematics , mathematics , pathwidth , graph drawing , graph
Graph drawing is the most important area of mathematics and computer science which combines methods from geometric graph theory and information visualization. Generally, graphs are represented to explore some intellectual ideas. Graph drawing is the familiar concept of graph theory. It has many quality measures and one among them is the slope number. Slope number problem is an optimization problem and is NP-hard to determine the slope number of any arbitrary graph. In the present paper, the investigation on slope number of bipartite graph is studied elaborately. Since the bipartite graphs creates one of the most intensively investigated classes of graphs, we consider few classes of graphs and discussed structural behavior of such graphs.