Read More
Date: 8-4-2022
![]()
Date: 6-8-2016
![]()
Date: 20-5-2022
![]() |
The helm graph is the graph obtained from an
-wheel graph by adjoining a pendant edge at each node of the cycle.
Helm graphs are graceful (Gallian 2018), with the odd case of established by Koh et al. 1980 and the even case by Ayel and Favaron (1984). The helm graph
is perfect only for
and even
.
Precomputed properties of helm graphs are available in the Wolfram Language using GraphData["Helm",
n, k
].
The -Helm graph has chromatic polynomial, independence polynomial, and matching polynomial given by
(1) |
|||
(2) |
|||
(3) |
where . These correspond to recurrence equations (together with for the rank polynomial) of
(4) |
|||
(5) |
|||
(6) |
|||
(7) |
Ayel, J. and Favaron, O. "Helms Are Graceful. In Progress in Graph Theory (Waterloo, Ont., 1982).
Toronto: Academic Press, pp. 89-92, 1984.Gallian, J. "Dynamic Survey of Graph Labeling." Elec. J. Combin. DS6. Dec. 21, 2018.
https://www.combinatorics.org/ojs/index.php/eljc/article/view/DS6.Koh, K. M.; Rogers, D. G.; and Yap, K. Y. "Graceful Graphs: Some Further Results and Problems." Congr. Numer. 29, 559-571, 1980.
|
|
"إنقاص الوزن".. مشروب تقليدي قد يتفوق على حقن "أوزيمبيك"
|
|
|
|
|
الصين تحقق اختراقا بطائرة مسيرة مزودة بالذكاء الاصطناعي
|
|
|
|
|
مكتب السيد السيستاني يعزي أهالي الأحساء بوفاة العلامة الشيخ جواد الدندن
|
|
|