%0 Journal Article
%T Structare of Sequentially Additive Graphs<br>序贯可加图的结构
%A CHEN Dong-Ling
%A HAN Cong-Ying
%A <br>陈东灵
%A 韩丛英
%J 数学物理学报(A辑)
%D 2004
%I 
%X Given a (p,q) graph G and positive integer k, an k sequentially additive numbering of G is an assignment of distinct numbers k,k+1,…,k+p+q-1,  to the p+q elements of G such that every edge uv of G receives the sum  of the numbers assigned to the vertices u and v. A graph which admits such an assignment to its  elements is called an k sequentially additive graph. In this paper, the authors give some  structural properties on sequentially additive graph, and a construction of inf inite families of k sequentially additive graphs.
%K Graph
%K Numbering
%K Construction
%K Sequentially additive<br>图
%K 编码
%K 结构
%K 序贯可加性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=4DB553CDB5F521D8C921082E5C95EC80&aid=0D9EDAEA2AB9FE4A&yid=D0E58B75BFD8E51C&vid=B91E8C6D6FE990DB&iid=0B39A22176CE99FB&sid=334E2BB8B9A55ABB&eid=AA27B676BFCAA4BE&journal_id=1003-3998&journal_name=数学物理学报(A辑)&referenced_num=0&reference_num=8