A affiliated graph G is dubbed Hamiltonian-t-laceable (Hamiltonian-t*-laceable) if there lies in it a Hamiltonian path middle from two points every pair (not completely one pair) of unconnected vertices u and v accompanying the property d(u,v) = ≤ t ≥ , 1 t diamG. In [1] the authors Vaidya and Bijukumar delineated the joint sum of the era Cn as follows. Consider two copies of Cn, combine a vertex of the first copy to a top of the second copy with a new edge. The new diagram obtained is named joint sum of Cn . Another type of diagram called the double diagram of a graph is built by taking two copies of G and accumulating edges u1v2 and v2u1 for every edge uv of G. The figure graph of a related graph G, designated by Img (G) , is the graph got by joining the top of the original graph G to the equivalent top of a copy of G. We investigate the laceability possessions of the image diagram of some classes of graphs in this place chapter.
Author(s) Details:
M. S. Annapoorna,
Department
of Mathematics, BMS Institute of Technology and Management, Bengaluru, India.
R.
Murali,
Department
of Mathematics, Dr. Ambedkar Institute of Technology, Bengaluru, India.
Please see the link here: https://stm.bookpi.org/RHMCS-V6/article/view/9803
No comments:
Post a Comment