In this paper, we compute the crossing number of a specific graph Hn, and then by contraction, we obtain the conclusion that cr（G13 × Sn） = 4[n/2] [n-1/2]＋[n/2] . The result fills up the blank of the crossing ...In this paper, we compute the crossing number of a specific graph Hn, and then by contraction, we obtain the conclusion that cr（G13 × Sn） = 4[n/2] [n-1/2]＋[n/2] . The result fills up the blank of the crossing numbers of Cartesian products of stars with all 5-vertex graphs presented by Marian Klesc.展开更多
基金Supported by the National Natural Science Foundation of China(10301010),Scienceand Technology Commission of Shanghai Municipality(04JC14031),and National Natural ScienceFoundation of Anhui(2006KJ256B)
基金supported by National Natural Science Foundation of Xingjiang,China“Fault-tolerance of graphs and networks”(2020D04046)National Natural Science Foundation of the People’s Republic of China“On the sizes of vertex(edge)-k-maximal r-uniform hypergraphs”(11261086)“On the disjoint path covers in graphs and related problems”(12261085)。
基金the National Natural Science Foundation of China (No.10771062)the New Century Excellent Tallents in University (No.NCET-07-0276)
文摘In this paper, we compute the crossing number of a specific graph Hn, and then by contraction, we obtain the conclusion that cr（G13 × Sn） = 4[n/2] [n-1/2]＋[n/2] . The result fills up the blank of the crossing numbers of Cartesian products of stars with all 5-vertex graphs presented by Marian Klesc.
