Zip product of graphs and crossing numbers

2020 ◽  
Vol 96 (2) ◽  
pp. 289-309
Author(s):  
Zhangdong Ouyang ◽  
Yuanqiu Huang ◽  
Fengming Dong ◽  
Eng Guan Tay
Keyword(s):  
Crossing Numbers ◽  
Product Of Graphs

scholarly journals Minimal number of crossings in strong product of paths

2013 ◽  
Vol 29 (1) ◽  
pp. 27-32
Author(s):  
MARIAN KLESC ◽  
◽  
JANA PETRILLOVA ◽  
MATUS VALO ◽  
◽  
...  
Keyword(s):  
Crossing Number ◽  
Cartesian Products ◽  
Crossing Numbers ◽  
Strong Product ◽  
Product Of Graphs

The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. The exact crossing number is known only for few specific families of graphs. Cartesian products of two graphs belong to the first families of graphs for which the crossing number has been studied. Some results concerning crossing numbers are also known for join products of two graphs. In the paper, we start to collect the crossing numbers for the strong product of graphs, namely for the strong product of two paths.

WIENER INVARIANTS OF PRODUCT OF GRAPHS

2020 ◽  
Vol 9 (4) ◽  
pp. 2365-2371
Author(s):  
S. Nagarajan ◽  
G. Priyadharsini
Keyword(s):  
Product Of Graphs

AN EQUITABLE TOTAL COLORING OF SOME CLASSES OF PRODUCT OF GRAPHS

2020 ◽  
Vol 9 (10) ◽  
pp. 8357-8365
Author(s):  
S. M. Aliyar ◽  
K. Manikandan ◽  
S. Manimaran
Keyword(s):  
Total Coloring ◽  
Product Of Graphs

scholarly journals Toll number of the strong product of graphs

2019 ◽  
Vol 342 (3) ◽  
pp. 807-814
Author(s):  
Tanja Gologranc ◽  
Polona Repolusk
Keyword(s):  
Strong Product ◽  
Product Of Graphs

s-strongly perfect cartesian product of graphs

1992 ◽  
Vol 16 (4) ◽  
pp. 297-303
Author(s):  
Elefterie Olaru ◽  
Eugen M??ndrescu
Keyword(s):  
Cartesian Product ◽  
Cartesian Product Of Graphs ◽  
Product Of Graphs

scholarly journals On the hamiltonian product of graphs: Corrigendum

1976 ◽  
Vol 15 (1) ◽  
pp. 159-159
Author(s):  
V. Krishnamoorthy
Keyword(s):  
Product Of Graphs

The author has noticed two small errors in his paper [1]: In Figure 1 on p. 290, the vertices labelled 4n, 4n + 1, 4n + 2 should be labelled 4n − 1, 4n, 4n + 1, respectively. In the 14th line on p. 291, “at a distance greater than 2n − 1” should read “at a distance greater than 2n − 2”.

scholarly journals The Crossing Numbers of Join Products of Paths and Cycles with Four Graphs of Order Five

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1277
Author(s):  
Michal Staš
Keyword(s):  
Connected Graph ◽  
Crossing Numbers ◽  
Tripartite Graph ◽  
Complete Tripartite Graph

The main aim of the paper is to establish the crossing numbers of the join products of the paths and the cycles on n vertices with a connected graph on five vertices isomorphic to the graph K1,1,3\e obtained by removing one edge e incident with some vertex of order two from the complete tripartite graph K1,1,3. The proofs are done with the help of well-known exact values for the crossing numbers of the join products of subgraphs of the considered graph with paths and cycles. Finally, by adding some edges to the graph under consideration, we obtain the crossing numbers of the join products of other graphs with the paths and the cycles on n vertices.

scholarly journals On super H−antimagicness of an edge comb product of graphs with subgraph as a terminal of its amalgamation

2017 ◽  
Vol 855 ◽  
pp. 012010 ◽  
Author(s):  
Dafik ◽  
Ika Hesti Agustin ◽  
A. I. Nurvitaningrum ◽  
R. M. Prihandini
Keyword(s):  
Product Of Graphs
Sign in / Sign up

Export Citation Format

Share Document