OALib Journal
  OALib Journal is an all-in-one open access journal (ISSN Print: 2333-9705, ISSN Online: 2333-9721). It accepts a manuscript for the peer-review processing, typesetting, publication and then allocated to one of the 322 subject areas. The article processing charge for publishing in OALib journal is Only $99. For more details, please contact service@oalib.com. Submit now
               Articles    |    Aims & Scope    |    Instructions for Author     |    Editorial Board     |    Publishing Price    |    Indexing             


Go

May 09, 2022Open    AccessArticle

On the Study of Binomial Theorem: Formulation of Conjecture for Odd Binomial Coefficients for Binomials with Indices of n = 2r – 1, Where r∈Z-*

Ellvan M. Campos, Ronald S. Decano
Because of the growing role of Binomial Theorem in various fields in Mathematics, such as in calculus and number theory, and even in societal advancements, such in technology and business, mathematicians continue to explore new developments in this interesting theorem. In this case, this study explored some of the unveiled concepts of Binomial Theorem for further studies, specifically on observing the relationships of the indices of the binomials to obtaining odd-valued binomial coefficients. Us...
Open Access Library J. Vol.9, 2022
Doi:10.4236/oalib.1108670


Jun 15, 2020Open    AccessArticle

Generalization of Stirling Number of the Second Kind and Combinatorial Identity

Ji Peng
The Stirling numbers of second kind and related problems are widely used in combinatorial mathematics and number theory, and there are a lot of research results. This article discuss the function: ∑AC11 AC22 ···ACkk (C1 C2 ··
...
Open Access Library J. Vol.7, 2020
Doi:10.4236/oalib.1106462


May 21, 2020Open    AccessArticle

Schultz and Modified Schultz Polynomials of Vertex Identification Chain for Square and Complete Square Graphs

Mahmood M. Abdullah, Ahmed M. Ali
In this paper, we find the polynomials, indices and average distance for Schultz and modified Schultz of vertex identification chain for 4-cycle and 4- cycle complete.
Open Access Library J. Vol.7, 2020
Doi:10.4236/oalib.1106309


Aug 27, 2019Open    AccessArticle

Schultz and Modified Schultz Polynomials of Some Cog-Special Graphs

Ahmed M. Ali, Haitham N. Mohammed
For a connected graph G, the Schultz and modified Schultz polynomials are defined as, respectively, where the summations are taken over all unordered pairs of distinct vertices in V(G), is the degree of vertex u, is the distance between u and v and V(G) is the vertex set of G. In this paper, we find Schultz and modified Schultz polynomials of the Cog-special graphs such as a complete graph,
...
Open Access Library J. Vol.6, 2019
Doi:10.4236/oalib.1105625


Dec 20, 2017Open    AccessArticle

Derivatives over Certain Finite Rings

Soud K. Mohamed
We introduce a derivative of a relation over the ring of integers modulo an odd number which is based on the very fundamental concepts which helped in the evolution of derivative of a function over the real number field, namely slope. Then, for a prime field GF(p
...
Open Access Library J. Vol.4, 2017
Doi:10.4236/oalib.1104116


Oct 17, 2016Open    AccessArticle

Soft Vibrational Force on Stock Market Networks

Mehmet Ali Balci, Qmer Akgüller
Stock market networks commonly involve uncertainty, and the theory of soft sets emerges as a powerful tool to handle it. In this study, we present a soft analogue of the differential of a vibrational potential function acting on a stock market network as vibrational force. For this purpose, we first study the vibrational potential function operating on each vertex by using the Laplacian of the neighborhood graph, then applied the
...
Open Access Library J. Vol.3, 2016
Doi:10.4236/oalib.1103050


Jun 27, 2016Open    AccessArticle

Log-Concavity of Centered Polygonal Figurate Number Sequences

Fekadu Tolessa Gedefa
This paper investigates the log-concavity of the centered m-gonal figurate number sequences. The author proves that for m≥3, the sequence {Cn(m)}
...
Open Access Library J. Vol.3, 2016
Doi:10.4236/oalib.1102774


May 19, 2015Open    AccessArticle

On a Logical Model of Combinatorial Problems

Anatoly D. Plotnikov
The paper proposes a logical model of combinatorial problems; it also gives an example of a problem of the class NP that cannot be solved in polynomial time on the dimension of the problem.
Open Access Library J. Vol.2, 2015
Doi:10.4236/oalib.1101479


Go

Contact Us

service@oalib.com

QQ:3279437679