On 1-sequentially additive graphs

Authors

  • Seoud M.A.
  • Jaber, Huda

Abstract

In this paper, we determine all 1-sequentially additive graphs of order 6 by using an algorithm written in C++ programming language. We label some 1- sequentially additive families. Some labelings are based on Skolem and hooked Skolem sequences.

Published

2022-09-20

How to Cite

Seoud M.A., & Jaber, Huda. (2022). On 1-sequentially additive graphs. Utilitas Mathematica, 102. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/1255

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.