Sequentially additive graphs |
| |
| Authors: | DW Bange AE Barkauskas PJ Slater |
| |
| Institution: | Mathematics Department, University of Wisconsin-La Crosse, La Crosse, WI 54601, USA;Applied Mathematics Division-5641, Sandia Laboratories (a U.S. D.O.E. facility), Albuquerque, NM 87185, USA |
| |
| Abstract: | The concept of a simply sequentially additive graph is introduced as follows. A graph G with |V(G)|+|E(G)|=M is said to be simply sequentially additive if there is a bijection f:V(G)∪E(G)→{;1,2,…,M}; such that for each x = (u, ν) in E(G), f(x) = f(u) + f(ν). Various aspects of finding such numberinga or showing that none exist are discussed. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
