پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 13 |
| تعداد شماره‌ها | 200 |
| تعداد مقالات | 2,008 |
| تعداد مشاهده مقاله | 2,680,294 |
| تعداد دریافت فایل اصل مقاله | 1,937,457 |
On the Zagreb indices of overfull molecular graphs | ||
| Journal of Discrete Mathematics and Its Applications | ||
| مقاله 5، دوره 4، 1-2، شهریور 2014، صفحه 37-44 اصل مقاله (643.2 K) | ||
| نوع مقاله: Original Article | ||
| شناسه دیجیتال (DOI): 10.22061/jmns.2014.482 | ||
| نویسنده | ||
| Maryam Jalali-Rad | ||
| Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, I. R. Iran | ||
| تاریخ دریافت: 14 دی 1392، تاریخ بازنگری: 21 فروردین 1393، تاریخ پذیرش: 21 اردیبهشت 1395 | ||
| چکیده | ||
| Let G be a connected graph on n vertices. An overfull graph is a graph whose number of its edges is greater than Δ × [n/2], where Δ is the maximum degree of vertices in G. In this paper, we compute the Zagreb indices of overfull molecular graphs. | ||
| کلیدواژه‌ها | ||
| overfull graph؛ Zagreb indices؛ Molecular graph | ||
| مراجع | ||
|
[1] G. Chartrand, P. Zhang, Chromatic Graph Theory, Chapman and Hall/CRC, 2008. [2] A. G. Chetwynd, A. J. W. Hilton, Star multi graphs with three vertices of maximum degree, Math. Proc. Cambr. Phil. Soc. 100 (1986) 303-317. [3] M. Ghorbani, Remarks of overfull graphs, Applied Mathematics 4 (2013) 1106-1108 [4] I. Gutman, N. Trinajstić, Graph theory and molecular orbitals, Total π-electron energy of alternant hydrocarbons, Chem. Phys. Lett. 17 (1972) 535 – 538 [5] T. Niessen, How to find overfull subgraphs in graphs with large maximum degree, Disc. Appl. Math. 51 (1994) 117-125. [6] M. Plantholt, Overfull Conjecture for graphs with high minimum degree, J. Graph Theory 47 (2004) 73-80. | ||
|
آمار تعداد مشاهده مقاله: 2,005 تعداد دریافت فایل اصل مقاله: 409 |
||