WIENER INVARIANTS OF 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”.

Download Full-text

Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets

Electronic Notes in Discrete Mathematics ◽

10.1016/j.endm.2007.01.006 ◽

2007 ◽

Vol 28 ◽

pp. 33-40 ◽

Cited By ~ 2

Author(s):

Attila Pór ◽

David R. Wood

Keyword(s):

Cartesian Product ◽

Sidon Sets ◽

Cartesian Product Of Graphs ◽

Product Of Graphs

Download Full-text

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

Journal of Physics Conference Series ◽

10.1088/1742-6596/855/1/012010 ◽

2017 ◽

Vol 855 ◽

pp. 012010 ◽

Cited By ~ 2

Author(s):

Dafik ◽

Ika Hesti Agustin ◽

A. I. Nurvitaningrum ◽

R. M. Prihandini

Keyword(s):

Product Of Graphs

Download Full-text

THE DIAMETER VARIABILITY OF THE CARTESIAN PRODUCT OF GRAPHS

Discrete Mathematics Algorithms and Applications ◽

10.1142/s1793830914500013 ◽

2014 ◽

Vol 06 (01) ◽

pp. 1450001 ◽

Cited By ~ 2

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.

Download Full-text