نتایج جستجو برای: graceful labellings
تعداد نتایج: 1772 فیلتر نتایج به سال:
Combinatorics of complexes plays an important role in topology, nonlinear analysis, game theory, and mathematical economics. In 1967, Ky Fan used door-to-door principle to prove a combinatorial Stokes’ theorem on pseudomanifolds. In 1993, Shih and Lee developed the geometric context of general position maps, π-balanced and π-subbalanced sets and used them to prove a combinatorial formula for mu...
Dung’s abstract theory of argumentation has become established as a general framework for various species of non-monotonic reasoning, and reasoning in the presence of conflict. A Dung framework consists of arguments related by attacks, and the extensions of a framework, and so the status of arguments, are defined under different semantics. Developments of Dung’s work have also defined argument ...
We present a constructive proof of Ky Fan’s combinatorial lemma concerning labellings of triangulated spheres. Our construction works for triangulations of Sn that contain a flag of hemispheres. As a consequence, we produce a constructive proof of Tucker’s lemma that holds for a larger class of triangulations than previous constructive proofs.
Roman domination in graphs is concerned with the problem of finding a vertex labelling, with minimum weight, satisfaying certain conditions. In this work, the authors initiate the study of a generalization to labellings of both vertices and edges in a graph.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید