
Go
May 21, 2020Open AccessArticle
In this paper, we find the polynomials, indices and average distance for Schultz and modified Schultz of vertex identification chain for 4cycle and 4 cycle complete.
Aug 27, 2019Open AccessArticle
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 Cogspecial graphs such as a complete graph, ...
Jul 11, 2017Open AccessArticle
In this paper, multiplicative version of degree
distance of a graph is defined and tight upper bounds of the graph operations
have been found.
Dec 09, 2016Open AccessArticle
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 ...
Oct 17, 2016Open AccessArticle
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 ...
Jun 27, 2016Open AccessArticle
This paper investigates the logconcavity of the centered mgonal figurate number sequences. The author proves that for m≥3, the sequence {C_{n}(m)} ...
Go


