نتایج جستجو برای: graceful labellings

تعداد نتایج: 1772  

Journal: :Journal of Combinatorial Theory, Series A 2006

Journal: :Electronic Notes in Discrete Mathematics 2015
Sylwia Cichacz-Przenioslo Dalibor Froncek Kiki A. Sugeng Sanming Zhou

Given a graph G with n vertices and an Abelian group A of order n, an A-distance antimagic labelling of G is a bijection from V (G) to A such that the vertices of G have pairwise distinct weights, where the weight of a vertex is the sum (under the operation of A) of the labels assigned to its neighbours. An A-distance magic labelling of G is a bijection from V (G) to A such that the weights of ...

2016
Federico Cerutti Massimiliano Giacomin Mauro Vallati Marina Zanella

This paper presents a meta-algorithm for the computation of preferred labellings, based on the general recursive schema for argumentation semantics called SCC-Recursiveness. The idea is to recursively decompose a framework so as to compute semantics labellings on restricted sub-frameworks, in order to reduce the computational effort. The meta-algorithm can be instantiated with a specific “base ...

2014
Federico Cerutti Massimiliano Giacomin Mauro Vallati Marina Zanella

This paper presents a meta-algorithm for the computation of preferred labellings, based on the general recursive schema for argumentation semantics called SCC-Recursiveness. The idea is to recursively decompose a framework so as to compute semantics labellings on restricted sub-frameworks, in order to reduce the computational effort. The meta-algorithm can be instantiated with a specific “base ...

2011
S. M. Hegde

In 1994, Du and Sun conjectured that, for any positive even n and any integer m, the digraph n. −→ Cm is graceful. In this paper we prove the conjecture. Also, in 1985, Bloom and Hsu mentioned that the question remains open for the non generalized graceful labelings. For example, the following question is currently unanswered: How many distinct graceful labelings does a designated graceful digr...

2005
Christopher Cox Jamie Nicolson Jenny Rose Finkel Christopher Manning

We initially describe a feature-rich discriminative Conditional Random Field (CRF) model for Information Extraction in the workshop announcements domain, which offers good baseline performance in the PASCAL shared task. We then propose a method for leveraging domain knowledge in Information Extraction tasks, scoring candidate document labellings as one-value-per-field templates according to dom...

Journal: :Electr. J. Comb. 2009
Tsz Lung Chan Wai Shun Cheung Tuen Wai Ng

One of the most famous open problems in graph theory is the Graceful Tree Conjecture, which states that every finite tree has a graceful labeling. In this paper, we define graceful labelings for countably infinite graphs, and state and verify a Graceful Tree Conjecture for countably infinite trees.

2012
N. Murugesan

In this paper, we have identified some of the graceful graphs which are obtained from the amalgamations of two graceful graphs. A conjecture is also discussed for general graceful graphs and the same is proved for Fibonacci graceful graphs. Mathematics Subject Classification: 05C78

2015
K. Murugan

A p. q graph G = V,E is said to be a square graceful graph ifthere exists an injective function f: V G → 0,1,2,3,... , q such that the induced mapping fp : E G → 1,4,9,... , q 2 defined by fp uv = f u − f v is an injection. The function f is called a square graceful labeling of G. In this paper the square graceful labeling of the caterpillar S X1,X2 ,... ,Xn , the graphs Pn−1 1,2,...n ,mK1,n ∪ ...

2013
G. Sethuraman P. Ragukumar Peter J. Slater

A function f is called a graceful labeling of a graph G with m edges if f is an injective function from V (G) to {0, 1, 2, · · · ,m} such that when every edge uv is assigned the edge label |f(u)− f(v)|, then the resulting edge labels are distinct. A graph which admits a graceful labeling is called a graceful graph. The popular Graceful Tree Conjecture states that every tree is graceful. The Gra...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید