نمایش مختصر رکورد

dc.contributor.authorBarrientos , Christianen_US
dc.contributor.authorMinion, Sarahen_US
dc.date.accessioned1399-07-09T06:07:29Zfa_IR
dc.date.accessioned2020-09-30T06:07:29Z
dc.date.available1399-07-09T06:07:29Zfa_IR
dc.date.available2020-09-30T06:07:29Z
dc.date.issued2016-12-01en_US
dc.date.issued1395-09-11fa_IR
dc.date.submitted2016-06-05en_US
dc.date.submitted1395-03-16fa_IR
dc.identifier.citationBarrientos , Christian, Minion, Sarah. (2016). Constructing Graceful Graphs with Caterpillars. Journal of Algorithms and Computation, 48(1), 117-125.en_US
dc.identifier.issn2476-2776
dc.identifier.issn2476-2784
dc.identifier.urihttps://jac.ut.ac.ir/article_7946.html
dc.identifier.urihttps://iranjournals.nlai.ir/handle/123456789/295967
dc.description.abstractA graceful labeling of a graph <em>G</em> of size <em>n</em> is an injective assignment of integers from {0, 1,...,<em> n</em>} to the vertices of <em>G</em>, such that when each edge of <em>G</em> has assigned a weight, given by the absolute di erence of the labels of its end vertices, the set of weights is {1, 2,..., <em>n</em>}. If a graceful labeling <em>f</em> of a bipartite graph <em>G</em> assigns the smaller labels to one of the two stable sets of <em>G</em>, then <em>f</em> is called an -labeling and <em>G</em> is said to be an <em>α</em>-graph. A tree is a caterpillar if the deletion of all its leaves results in a path. In this work we study graceful labelings of the disjoint union of a cycle and a caterpillar. We present necessary conditions for this union to be graceful and, in the case where the cycle has even size, to be an <em>α</em> -graph. In addition, we present a new family of graceful trees constructed using <em>α</em>-labeled caterpillars.en_US
dc.format.extent447
dc.format.mimetypeapplication/pdf
dc.languageEnglish
dc.language.isoen_US
dc.publisherUniversity of Tehranen_US
dc.relation.ispartofJournal of Algorithms and Computationen_US
dc.subjectgraceful labelingen_US
dc.subjectcaterpillaren_US
dc.subjectgraceful treesen_US
dc.titleConstructing Graceful Graphs with Caterpillarsen_US
dc.typeTexten_US
dc.typeResearch Paperen_US
dc.contributor.departmentDepartment of Mathematics, Clayton State University, Morrow, Georgia 30260, USAen_US
dc.contributor.departmentDepartment of Mathematics, Clayton State University, Morrow, Georgia 30260, USAen_US
dc.citation.volume48
dc.citation.issue1
dc.citation.spage117
dc.citation.epage125


فایل‌های این مورد

Thumbnail

این مورد در مجموعه‌های زیر وجود دارد:

نمایش مختصر رکورد