Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Indonesian Journal of Combinatorics
Sarah Minion
Full Sail University
Computer Science & IT Decision Sciences, Operations Research & Management

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Broader families of cordial graphs Christian Barrientos; Sarah Minion
Indonesian Journal of Combinatorics Vol 5, No 1 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2021.5.1.6

Abstract

A binary labeling of the vertices of a graph G is cordial if the number of vertices labeled 0 and the number of vertices labeled 1 differ by at most 1, and the number of edges of weight 0 and the number of edges of weight 1 differ by at most 1. In this paper we present general results involving the cordiality of graphs that results of some well-known operations such as the join, the corona, the one-point union, the splitting graph, and the super subdivision. In addition we show a family of cordial circulant graphs.
Co-Authors Christian Barrientos