The Hamiltonian product of graphs

1974 ◽  
pp. 86-95 ◽  
Author(s):  
I. A. Peckham
Keyword(s):  
Product Of Graphs

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 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

THE DIAMETER VARIABILITY OF THE CARTESIAN PRODUCT OF GRAPHS

2014 ◽  
Vol 06 (01) ◽  
pp. 1450001 ◽  
Author(s):  
M. R. CHITHRA ◽  
A. VIJAYAKUMAR
Keyword(s):  
Interconnection Networks ◽  
Cartesian Product ◽  
Graph Products ◽  
Single Edge ◽  
Cartesian Product Of Graphs ◽  
Product Of Graphs

The diameter of a graph can be affected by the addition or deletion of edges. In this paper, we examine the Cartesian product of graphs whose diameter increases (decreases) by the deletion (addition) of a single edge. The problems of minimality and maximality of the Cartesian product of graphs with respect to its diameter are also solved. These problems are motivated by the fact that most of the interconnection networks are graph products and a good network must be hard to disrupt and the transmissions must remain connected even if some vertices or edges fail.

scholarly journals -super antimagic total labeling of comb product of graphs

2019 ◽  
Vol 16 (2) ◽  
pp. 163-171 ◽  
Author(s):  
Ika Hesti Agustin ◽  
R.M. Prihandini ◽  
Dafik
Keyword(s):  
Product Of Graphs
Sign in / Sign up

Export Citation Format

Share Document