CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Crossing Number of Join of Triangular Snake with mK1, Path and Cycle

by Bharati Rajan, Indra Rajasingh, P.vasanthi Beulah
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 44 - Number 17
Year of Publication: 2012
Authors: Bharati Rajan, Indra Rajasingh, P.vasanthi Beulah
10.5120/6356-8782

Bharati Rajan, Indra Rajasingh, P.vasanthi Beulah . Crossing Number of Join of Triangular Snake with mK1, Path and Cycle. International Journal of Computer Applications. 44, 17 ( April 2012), 20-22. DOI=10.5120/6356-8782

@article{ 10.5120/6356-8782,
author = { Bharati Rajan, Indra Rajasingh, P.vasanthi Beulah },
title = { Crossing Number of Join of Triangular Snake with mK1, Path and Cycle },
journal = { International Journal of Computer Applications },
issue_date = { April 2012 },
volume = { 44 },
number = { 17 },
month = { April },
year = { 2012 },
issn = { 0975-8887 },
pages = { 20-22 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume44/number17/6356-8782/ },
doi = { 10.5120/6356-8782 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:36:27.124326+05:30
%A Bharati Rajan
%A Indra Rajasingh
%A P.vasanthi Beulah
%T Crossing Number of Join of Triangular Snake with mK1, Path and Cycle
%J International Journal of Computer Applications
%@ 0975-8887
%V 44
%N 17
%P 20-22
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The exact values of the crossing number is known only for a specific family of graphs. There are few results concerning crossing numbers of join of some graphs. We give the exact value of crossing number of the join of a certain graph G on with an empty graph, a path and a cycle respectively on m vertices.

References
  1. <ul style="text-align: justify;"> Bhatt, S. N. and Leighton, F. T. "A framework for solving VLSI graph layout problems", J. Comput. System Sci. 28 (1984), 300–343. Leighton, F. T. "New lower bound techniques for VLSI", Math. Systems Theory ,17 (1984), 47–70. Székely, L. A. "A Successful Concept for Measuring Nonplanarity of Graphs: the Crossing Number", Discrete Math. , 276 (2004), 331–352. Garey, M. R. and Johnson, D. S. "Crossing Number is NP–Complete", SIAM J. Alg. Disc. Meth,
Index Terms

Computer Science
Information Sciences

Keywords

Drawing Of A Graph Crossing Number Union And Join Of Graphs Triangular Snake Path Cycle

Powered by PhDFocusTM