Article Per Year (5 Year)
p-Index From 2021 - 2026
0.61
P-Index
This Author published in this journals
All Journal Indonesian Journal of Combinatorics
Christian Barrientos
Valencia College
Computer Science & IT Decision Sciences, Operations Research & Management

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

Found 4 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.
On additive vertex labelings Christian Barrientos
Indonesian Journal of Combinatorics Vol 4, No 1 (2020)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (300.511 KB) | DOI: 10.19184/ijc.2020.4.1.5

Abstract

In a quite general sense, additive vertex labelings are those functions that assign nonnegative integers to the vertices of a graph and the weight of each edge is obtained by adding the labels of its end-vertices. In this work we study one of these functions, called harmonious labeling. We calculate the number of non-isomorphic harmoniously labeled graphs with n edges and at most n vertices. We present harmonious labelings for some families of graphs that include certain unicyclic graphs obtained via the corona product. In addition, we prove that all n-cell snake polyiamonds are harmonious; this type of graph is obtained via edge amalgamation of n copies of the cycle C3 in such a way that each copy of this cycle shares at most two edges with other copies. Moreover, we use the edge-switching technique on the cycle C4t to generate unicyclic graphs with another type of additive vertex labeling, called strongly felicitous, which has a solid bond with the harmonious labeling.
On graphs with α- and b-edge consecutive edge magic labelings Christian Barrientos
Indonesian Journal of Combinatorics Vol 6, No 1 (2022)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

Among the most studied graph labelings we have the varieties called alpha and edge-magic. Even when their definitions seem completely different, these labelings are related. A graceful labeling of a bipartite graph is called an α-labeling if the smaller labels are assigned to vertices of the same stable set. An edge-magic labeling of a graph of size n is said to be b-edge consecutive when its edges are labeled with the integers b+1, b+2, ..., b+n, for some 0 ≤ b ≤ n. In this work, we prove the existence of several b edge-magic labelings for any graph of order m and size m-1 that admits an α-labeling. In addition, we determine the exact value of b induced by the α-labeling, as well as for its reverse, complementary, and reverse complementary labelings.
On the number of caterpillars Christian Barrientos
Indonesian Journal of Combinatorics Vol 6, No 2 (2022)
Publisher : Indonesian Combinatorial Society (InaCombS)

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

Abstract

A caterpillar is a tree obtained from a path by attaching pendant vertices. The number of caterpillars of size n is a well-known result. In this work extend this result exploring the number of caterpillars of size n together with the cardinalities of the stable sets and the diameter. Three closed formulas are presented, giving the number of caterpillars of size n with: (i) smaller stable set of cardinality k, (ii) diameter d, and (iii) diameter d and smaller stable set of cardinality k.
Co-Authors Sarah Minion