Prime cordial and 3-equitable prime cordial graphs

Authors

  • Seoud M.A.
  • Jaber, Huda

Abstract

In this paper we give some properties of prime cordial and 3-equitable prime cordial graphs, we determine all prime cordial graphs of order 7, we give some of their families and we give the maximum number of edges in a 3-equitable prime cordial graph using two methods. © 2019 Utilitas Mathematica Publishing Inc.. All rights reserved.

Published

2019-06-09

How to Cite

Seoud M.A., & Jaber, Huda. (2019). Prime cordial and 3-equitable prime cordial graphs. Utilitas Mathematica, 111. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/1410

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.