THE CYLINDRICAL CROSSING NUMBER OF ZERO DIVISOR GRAPHS

2020 ◽  
Vol 9 (8) ◽  
pp. 5901-5908
Author(s):  
M. Sagaya Nathan ◽  
J. Ravi Sankar
Keyword(s):  
Zero Divisor ◽  
Crossing Number

Rectilinear crossing number of a zero divisor graph

2013 ◽  
Vol 8 ◽  
pp. 583-589
Author(s):  
M. Malathi ◽  
S. Sankeetha ◽  
J. Ravi Sankar ◽  
S. Meena
Keyword(s):  
Zero Divisor ◽  
Crossing Number ◽  
Zero Divisor Graph

On the Crossing Number of $K_{m,n}$

10.37236/1748 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Nagi H. Nahas
Keyword(s):  
Lower Bound ◽  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Crossing Number

The best lower bound known on the crossing number of the complete bipartite graph is : $$cr(K_{m,n}) \geq (1/5)(m)(m-1)\lfloor n/2 \rfloor \lfloor(n-1)/2\rfloor$$ In this paper we prove that: $$cr(K_{m,n}) \geq (1/5)m(m-1)\lfloor n/2 \rfloor \lfloor (n-1)/2 \rfloor + 9.9 \times 10^{-6} m^2n^2$$ for sufficiently large $m$ and $n$.

scholarly journals Join Products K2,3 + Cn

Mathematics ◽  
2020 ◽  
Vol 8 (6) ◽  
pp. 925
Author(s):  
Michal Staš
Keyword(s):  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Crossing Number ◽  
Arithmetic Means ◽  
Minimum Number ◽  
Edge Crossings

The crossing number cr ( G ) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. The main goal of the paper is to state the crossing number of the join product K 2 , 3 + C n for the complete bipartite graph K 2 , 3 , where C n is the cycle on n vertices. In the proofs, the idea of a minimum number of crossings between two distinct configurations in the various forms of arithmetic means will be extended. Finally, adding one more edge to the graph K 2 , 3 , we also offer the crossing number of the join product of one other graph with the cycle C n .

Eigenvalues of zero divisor graphs of principal ideal rings

2021 ◽  
pp. 1-15
Author(s):  
Jitsupat Rattanakangwanwong ◽  
Yotsanan Meemark
Keyword(s):  
Principal Ideal ◽  
Zero Divisor

scholarly journals Improvement on the Crossing Number of Crossing-Critical Graphs

2020 ◽  
Author(s):  
János Barát ◽  
Géza Tóth
Keyword(s):  
Crossing Number ◽  
Critical Graphs ◽  
Minimum Number ◽  
Edge Crossings

AbstractThe crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. A graph G is k-crossing-critical if its crossing number is at least k, but if we remove any edge of G, its crossing number drops below k. There are examples of k-crossing-critical graphs that do not have drawings with exactly k crossings. Richter and Thomassen proved in 1993 that if G is k-crossing-critical, then its crossing number is at most $$2.5\, k+16$$ 2.5 k + 16 . We improve this bound to $$2k+8\sqrt{k}+47$$ 2 k + 8 k + 47 .

scholarly journals Correction to: Classification of non-local rings with genus two zero-divisor graphs

2021 ◽  
Vol 25 (4) ◽  
pp. 3355-3356
Author(s):  
T. Asir ◽  
K. Mano ◽  
T. Tamizh Chelvam
Keyword(s):  
Zero Divisor ◽  
Local Rings ◽  
Non Local ◽  
Genus Two

scholarly journals On the set of divisors with zero geometric defect

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Dinh Tuan Huynh ◽  
Duc-Viet Vu
Keyword(s):  
Line Bundle ◽  
Zero Divisor ◽  
Ample Line Bundle ◽  
Holomorphic Section ◽  
Projective Manifold ◽  
Holomorphic Curve ◽  
Very Ample Line Bundle ◽  
Complex Projective ◽  
Geometric Defect

AbstractLet {f:\mathbb{C}\to X} be a transcendental holomorphic curve into a complex projective manifold X. Let L be a very ample line bundle on {X.} Let s be a very generic holomorphic section of L and D the zero divisor given by {s.} We prove that the geometric defect of D (defect of truncation 1) with respect to f is zero. We also prove that f almost misses general enough analytic subsets on X of codimension 2.

Sign in / Sign up

Export Citation Format

Share Document