تعداد نشریات | 5 |
تعداد شمارهها | 108 |
تعداد مقالات | 1,228 |
تعداد مشاهده مقاله | 1,147,434 |
تعداد دریافت فایل اصل مقاله | 1,006,634 |
On the distance spectra of product of signed graphs | ||
Communications in Combinatorics and Optimization | ||
مقاله 6، دوره 8، شماره 1، خرداد 2023، صفحه 67-76 اصل مقاله (383.79 K) | ||
نوع مقاله: Original paper | ||
شناسه دیجیتال (DOI): 10.22049/cco.2021.27304.1227 | ||
نویسندگان | ||
Shijin T.V.* 1؛ Soorya P.1؛ Shahul Hameed K.2؛ Germina K. A.3 | ||
1Department of Mathematics, Central University of Kerala, Kasaragod, India. | ||
2Department of Mathematics, K M M Government Women's College, Kannur, India. | ||
3Department of Mathematics, Central University of Kerala, Kasaragod, India | ||
چکیده | ||
In this article, we study the distance matrix of the product of signed graphs such as the Cartesian product and the lexicographic product in terms of the signed distance matrices of the factor graphs. Also, we discuss the signed distance spectra of some special classes of product of signed graphs. | ||
کلیدواژهها | ||
Signed graph؛ Signed distance matrix؛ Signed distance spectrum؛ Product of signed graphs | ||
مراجع | ||
[1] P.J. Davis, Circulant Matrices, Wiley, New York, 1979.
[2] K.A. Germina and T. Zaslavsky, On products and line graphs of signed graphs, their eigenvalues and energy, Linear Algebra Appl. 435 (2011), no. 10, 2432–2450.
[3] Shahul K. Hameed, T.V. Shijin, P. Soorya, K.A. Germina, and T. Zaslavsky, Signed distance in signed graphs, Linear Algebra Appl. 608 (2021), 236–247.
[4] F. Harary, Graph Theory, Addison-Wesley Publishing Co., 1969.
[5] K. Shahul Hameed and K. Germina, On composition of signed graphs, Discuss. Math. Graph Theory 32 (2012), no. 3, 507–516.
[6] T.V. Shijin, P. Soorya, K Shahul Hameed, and K.A. Germina, On distance compatibility in product of signed graphss, (communicated).
[7] T. Zaslavsky, Six signed petersen graphs, and their automorphisms, Discrete Math. 312 (2012), no. 9, 1558–1583.
[8] F. Zhang, Matrix Theory: Basic Results and Techniques, Springer–Verlag, 1999.
| ||
آمار تعداد مشاهده مقاله: 500 تعداد دریافت فایل اصل مقاله: 1,035 |