Pedro Bello

Pedro Bello


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 July 2021 in IEEE Latin America Transactions
Verified
Journal Article
Closed access
PBPedro Bello
Pedro Bello
Guillermo De ItaGuillermo De Ita
Guillermo De Ita
The belief revision process involves several problems considered hard. One of the crucial problems is how to represent to the knowledge base K to consider, as well as how to represent and to add new information , which may even be contradictory to the knowledge base. In this work, both the knowledge base and the new information are in conjunctive normal form. Each clause of a conjunctive normal form is encoded by a string consisting of: 0, 1, *, representing the falsifying assignments of the clause. To use the falsifying assignments of the clauses allows to perform efficiently different logical operators among conjunctive forms. Our belief revision process (K * ) between conjunctive forms is based on solving first the propositional inference, i.e. K = . Based on to count falsifying assignments represented by tertiary chains, an algorithmic proposal is made that allows to determine in a practical way, when (K E ( K * )) is inconsistent. Finally, the time-complexity analysis of our algorithmic proposal is carried out.


21 March 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
Guillermo De ItaGuillermo De Ita
Guillermo De Ita
PBPedro Bello
Pedro Bello
JMJosé Raymundo Marcial-Romero
José Raymundo Marcial-Romero
The issue of counting independent sets of a graph, G, represented as i(G), is a significant challenge within combinatorial mathematics. This problem finds practical applications across various fields, including mathematics, computer science, physics, and chemistry. In chemistry, i(G) is recognized as the Merrifield–Simmons (M-S) index for molecular graphs, which is one of the most relevant topological indices related to the boiling point in chemical compounds. This article introduces an innovative algorithm designed for tallying independent sets within grid-like structures. The proposed algorithm is based on the ‘branch-and-bound’ technique and is applied to compute i(Gm,n) for a square grid formed by m rows and n columns. The proposed approach incorporates the widely recognized vertex reduction rule as the basis for splitting the current subgraph. The methodology involves breaking down the initial grid iteratively until outerplanar graphs are achieved, serving as the ’basic cases’ linked to the leaf nodes of the computation tree or when no neighborhood is incident to a minimum of five rectangular internal faces. The time complexity of the branch-and-bound algorithm speeds up the computation of i(Gm,n) compared to traditional methods, like the transfer matrix method. Furthermore, the scope of the proposed algorithm is more general than the algorithms focused on grids since it could be applied to process general mesh graphs.

Verified
Conference Paper
Open access
PDF file
Guillermo De ItaGuillermo De Ita
Guillermo De Ita
PBPedro Bello
Pedro Bello
MVMireya Tovar Vidal
Mireya Tovar Vidal
A relevant problem in combinatorial mathematics is the problem of counting independent sets of a graph G, denoted by i(G). This problem has many applications in combinatorics, physics, chemistry and computer science. For example, in statistical physics, the computation of i(G) has been useful in studying the behavior of the particles of a gas on a space modeled by a grid structure. Regarding hard counting problems, the computation of i(G) for a graph G has been key to determining the frontier between efficient counting and intractable counting procedures. In this article, a novel algorithm for counting independent sets on grid-like structures is presented. We propose a novel algorithm for the computation of i(Gm,n) for a grid graph with m rows and n columns based on the ‘Branch and Bound’ design technique. The splitting rule in our proposal is based on the well-known vertex reduction rule. The vertex in any subgraph from Gm,n, which is to be selected for the reduction rule, must have four internal incident faces. The ramification process is used to build a computation tree. Our proposal consists of decomposing the initial grid graph until outerplanar graphs are obtained as the ‘basic subgrids’ associated with the leave nodes of the computation tree. The resulting time-complexity of our proposal is inferior to the time-complexity of other classic methods, such as the transfer matrix method.

12 June 2024 in International Journal of Combinatorial Optimization Problems and Informatics
Verified
Journal Article
Open access
PDF file
Guillermo De ItaGuillermo De Ita
Guillermo De Ita
PBPedro Bello
Pedro Bello
MGMeliza Contreras González
Meliza Contreras González
JMJosé Raymundo Marcial-Romero
José Raymundo Marcial-Romero
We determine extremal graphs with respect to the number of independent sets for polygonal chains joined by cutting edges. We show that for any class of polygonal chains, independently of the number of sides on each polygon, the zig-zag polygonal chain has the extremal minimum value. Meanwhile, the polygonal chain at distance 2 between any two consecutive cutting edges provides the extremal maximum value. These results generalize and formalize previous ideas about phenylene chains. To recognize those extremal topologies, extremal values for the product between two Fibonacci numbers with complementary indices are determined. The product between two Fibonacci numbers with complementary indices are also applied for recognizing extremal graphs when a path is extended with one more vertex, or when any independent subgraph is linked to the path. Our results are achieved by applying decomposition of the input graph through the vertex and edge division rules.

1 January 2023 in Match Communications in Mathematical and in Computer Chemistry
Verified
Journal Article
Closed access
Guillermo De ItaGuillermo De Ita
Guillermo De Ita
MPMexico Benem´erita Universidad Aut´onoma de Puebla
Mexico Benem´erita Universidad Aut´onoma de Puebla
PBPedro Bello
Pedro Bello
MCMeliza Contreras
Meliza Contreras