Full entry |
PDF
(0.2 MB)
Feedback

$P_3$ intersection graph; connectivity; container; wide diameter

References:

[1] Broersma, H. J., Hoede, C.: **Path graphs**. J. Graph Theory 13 (1989), 427-444. DOI 10.1002/jgt.3190130406 | MR 1010578 | Zbl 0677.05068

[2] Chartrand, G., Lesniak, L.: **Graphs and Digraphs, 4th edition**. Chapman and Hall/CRC, Boca Raton, FL (2005). MR 2107429

[3] Du, D. Z., Hsu, D. F., Lyuu, Y. D.: **On the diameter vulnerability of Kautz digraphs**. Discrete Math. 151 (1996), 81-85. DOI 10.1016/0012-365X(94)00084-V | MR 1391254 | Zbl 0853.05043

[4] Ferrero, D.: **Connectivity of path graphs**. Acta. Math. Univ. Comen., New Ser. 72 (2003), 59-66. MR 2020578 | Zbl 1100.05056

[5] Hsu, L. H., Lin, C. K.: **Graph Theory and Interconnection Networks**. CRC Press, Boca Raton, FL (2008). MR 2454502

[6] Menon, Manju K., Vijayakumar, A.: **The $P_3$ intersection graph**. Util. Math. 75 (2008), 35-50. MR 2389697 | Zbl 1172.05045

[7] Menon, Manju K., Vijayakumar, A.: **The dynamics of the $P_3$ intersection graph**. J. Combin. Math. and Combin. Comput. 73 (2010), 127-134. MR 2657320

[8] Prisner, E.: **Graph Dynamics**. Pitman Research Notes in Mathematics Series 338, Longman, Essex, UK (1995). MR 1379114 | Zbl 0848.05001