The F-index of a graph is defined as the sum of cubes of the vertex degrees of the graph. In this paper, we introduce a new invariant which is named as F-coindex. Here, we study basic mathematical properties and the behavior of the newly introduced F-coindex under several graph operations such as union, join, Cartesian product, composition, tensor product, strong product, corona product, disjun...

Onions can be stored for six months or longer at recommended storage conditions of 0° C and 6570% relatively humidity (RH) (Hardenburg, et al., 1986). Under low humidity storage, onions can suffer substantial moisture loss resulting in reduced salable product. However, under high humidity, onions may develop blue and black mold as well as soft rot caused by spp, , and , respectively. Corona dis...

For a (molecular) graph, the hyper Zagreb index is defined as HM(G) = ∑ uv∈E(G) (dG(u) + dG(v)) 2 and the hyper Zagreb coindex is defined asHM(G) = ∑ uv/ ∈E(G) (dG(u)+dG(v)) 2. In this paper, the hyper Zagreb indices and its coindices of edge corona product graph, double graph and Mycielskian graph are obtained.

For an ordered k-decomposition D = {G1, G2,...,Gk} of a connected graph G (V,E), the D-representation edge e is k-tuple γ(e/D)=(d(e, G1), d(e, G2), ...,d(e, Gk)), where Gi) represents distance from to Gi. A decomposition resolving if every two distinct edges have representations. The minimum k for which has its dimension dec(G). In this paper, corona product path Pn and cycle Cn with complete g...

Abstract Graph products have been extensively applied to model complex networks with striking properties observed in real-world systems. In this paper, we study the hitting times for random walks on a class of graphs generated iteratively by edge corona product. We first derive recursive solutions eigenvalues and eigenvectors normalized adjacency matrix associated graphs. Based these results, f...

In this paper we study the behavior of the second edge-Wiener index under the join and corona product of graphs. Results are applied for some classes of graphs such as suspensions, bottlenecks, and thorny graphs. 2010 Mathematics Subject Classification: 05C12; 05C62; 92E10

A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted χ=(G). It is known that this problem is NP-hard in general case and remains so for corona graphs. In [12] Lin i Chan...

The centrosome of Dictyostelium discoideum is a nucleusassociated body consisting of an electron-dense, threelayered core surrounded by an amorphous matrix, the corona. To elucidate the molecular and supramolecular architecture of this unique microtubule-organizing center, we have isolated and sequenced the gene encoding γ-tubulin and have studied its localization in the Dictyostelium centrosom...