OALib 期刊
  OALib Journal (ISSN Print: 2333-9705, ISSN Online: 2333-9721)是一本多合一的开源期刊,以同行评审的方式出版发行文章,其所涵盖的研究领域多达311种领域。本刊发表的全部文章均可在期刊网站上免费阅读、下载、引用和传播。单篇文章出版费用为99美元。详情请咨询service@oalib.com 或 QQ: 3279437679 WhatsApp +8615387084133 WeChat 1538708413。现在就去投稿!
               文章    |    目标与领域    |    读者指南    |    编委    |    文章版面费    |    检索             


Go

Nov 11, 2021Open    Access

A Cone-Dominance Approach for Discrete Alternative Multiple Criteria Problems with Indifference Regions

Vahid Lotfi
In this paper, we address the problem of solving discrete alternative multiple criteria decision making (MCDM) problems where some or all of the criteria might have indifference regions. We utilize the classical cone-dominance approach and significantly extend the associated theory. We then develop a convergent solution method based on cone-dominance for achieving the most preferred choice. The convergent method utilizes pairwise comparisons of the alternatives by the decision maker (DM) to elim...
Open Access Library J.   Vol.8, 2021
Doi:10.4236/oalib.1108093


Oct 20, 2021Open    Access

Further Study of the Shape of the Numbers and More Calculation Formulas

Ji Peng
The core of Shape of numbers is formal calculation, which has three forms. This paper proves the equivalence of these forms and extends the formula to the general case. Some properties of the coefficients are summarized and some new conclusions are drawn. The coefficient matrix is studied and the corresponding results are obtained. Using the formal method, the calculation formula of ∑n-0N-1Πi-1M (K...
Open Access Library J.   Vol.8, 2021
Doi:10.4236/oalib.1107969


Mar 26, 2021Open    Access

Redefining the Shape of Numbers and Three Forms of Calculation

Ji Peng
This paper redefines the Shape of numbers, makes it more natural and concise, and the domain of definition is extended to ring. The inconvenient PCHG() and PH() are removed. The concept of subsets is also removed. The new definition can be used to calculate ∑n-0N-1Πi-1M (Ki n×Di)
ni,j-0j-N-1Πi-1...
Open Access Library J.   Vol.8, 2021
Doi:10.4236/oalib.1107277


Jan 26, 2021Open    Access

Expansion of the Shape of Numbers

Ji Peng
This article extends the concept of the shape of numbers. Originally, a shape was defined as [1, K1, K2, ···], 1<K1<K2< ···, KiN. In this paper, the domain of a shape is extended from N to Z, the low bound is extended from 1 to Z, and Ki<Ki 1, Ki=Ki 1, K...
Open Access Library J.   Vol.8, 2021
Doi:10.4236/oalib.1107120


Dec 31, 2020Open    Access

Subset of the Shape of Numbers

Ji Peng
This article is based on the concept of Shape of numbers, introduces subset of the Shape and obtains its calculation formula. This article also makes some analysis and draws new conclusions, especially the calculation method of 1M 2M 3M ··· NM. The Shape’s concept becomes clearer and richness.
Open Access Library J.   Vol.7, 2020
Doi:10.4236/oalib.1107040


Sep 22, 2020Open    Access

Subdivide the Shape of Numbers and a Theorem of Ring

Ji Peng
This article is based on the concept of Shape of numbers, introduce more shapes, obtain the calculation formulas and find an explanation of the formulas. By observing and associating, show a law about the symmetry of Ring.
Open Access Library J.   Vol.7, 2020
Doi:10.4236/oalib.1106719


May 21, 2020Open    Access

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    Access

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


Jul 11, 2017Open    Access

Sharp Upper Bounds for Multiplicative Degree Distance of Graph Operations

R. Muruganandam, R. S. Manikandan, M. Aruvi
In this paper, multiplicative version of degree distance of a graph is defined and tight upper bounds of the graph operations have been found.
Open Access Library J.   Vol.4, 2017
Doi:10.4236/oalib.1102987


Dec 09, 2016Open    Access

The Four-Color Theorem of Map-Making Proved by Construction

John W. Oller Jr.
The objective of this paper is to prove by simple construction, generalized by induction, that the bounded areas on any map, such as found on the surface of a sheet of paper or a spherical globe, can be colored completely with just 4 distinct colors. Rather than following the tradition of examining each of tens of thousands of designs that can be produced on a planar surface, the approach here is to all the ways that any given pla
...
Open Access Library J.   Vol.3, 2016
Doi:10.4236/oalib.1103089


Go

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133

WeChat 1538708413