پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 161 |
| تعداد شماره‌ها | 6,479 |
| تعداد مقالات | 70,032 |
| تعداد مشاهده مقاله | 123,013,341 |
| تعداد دریافت فایل اصل مقاله | 96,245,635 |
Detour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel | ||
| Journal of Algorithms and Computation | ||
| مقاله 11، دوره 51، شماره 1، شهریور 2019، صفحه 129-145 اصل مقاله (284.71 K) | ||
| شناسه دیجیتال (DOI): 10.22059/jac.2019.71870 | ||
| نویسندگان | ||
| P. Titus* 1؛ S. Santha Kumari2 | ||
| 1Assistant Professor Department of Mathematics University College of Engineering Nagercoil Anna University, Tirunelveli Region Tamil Nadu, India. | ||
| 2Anna University, Tirunelveli Region Nagercoil - 629 004, India. | ||
| چکیده | ||
| A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $\psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most one detour monophonic path in $\psi_{dm}$ and every edge of $G$ is in exactly one detour monophonic path in $\psi_{dm}$. The minimum cardinality of a detour monophonic graphoidal cover of $G$ is called the detour monophonic graphoidal covering number of $G$ and is denoted by $\eta_{dm}(G)$. In this paper, we find the detour monophonic graphoidal covering number of corona product of wheel with some standard graphs | ||
| کلیدواژه‌ها | ||
| graphoidal cover؛ monophonic path؛ detour monophonic graphoidal cover؛ detour monophonic graphoidal covering number | ||
|
آمار تعداد مشاهده مقاله: 356 تعداد دریافت فایل اصل مقاله: 241 |
||