SID.ir New Version

Paper Information

Journal:   IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A- SCIENCE   2014 , Volume 38 , Number A1; Page(s) 9 To 17.
 
Paper: 

Vertex Centered Crossing Number For Maximal Planar Graph

 
 
Author(s):  Baskar Babujee J.*, Shanthini N.
 
* DEPARTMENT OF MATHEMATICS, ANNA UNIVERSITY, CHENNAI, 600 025, INDIA
 
Abstract: 
The crossing number of a graph G is the minimum number of edge crossings over all possibl e drawings of G in a plane. The crossing number is an important measure of the non-planarity of a graph, with ap plications in discrete and computational geometry and VLSI circuit design. In this paper we introduce vertex cente red crossing number and study the same for maximal planar graph.
 
Keyword(s): MAXIMAL PLANAR, CROSSING NUMBER, VERTEX-CENTERED CROSSING NUMBER
 
 
International related papers: 
 
Most related Highly related Moderately related Least related
 
References: 
  • Not Registered.
  •  
  •  
 
Citations: 
  • Not Registered.
 
+ Click to Cite.
APA: Copy

BASKAR BABUJEE, J., & SHANTHINI, N. (2014). VERTEX CENTERED CROSSING NUMBER FOR MAXIMAL PLANAR GRAPH. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A- SCIENCE, 38(A1), 9-17. https://www.sid.ir/en/journal/ViewPaper.aspx?id=402282



Vancouver: Copy

BASKAR BABUJEE J., SHANTHINI N.. VERTEX CENTERED CROSSING NUMBER FOR MAXIMAL PLANAR GRAPH. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A- SCIENCE. 2014 [cited 2022August08];38(A1):9-17. Available from: https://www.sid.ir/en/journal/ViewPaper.aspx?id=402282



IEEE: Copy

BASKAR BABUJEE, J., SHANTHINI, N., 2014. VERTEX CENTERED CROSSING NUMBER FOR MAXIMAL PLANAR GRAPH. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A- SCIENCE, [online] 38(A1), pp.9-17. Available: https://www.sid.ir/en/journal/ViewPaper.aspx?id=402282.



 
  pdf-File
Yearly Visit 44
 
 
Latest on Blog
Enter SID Blog