Recently, real world networks having constant/shrinking diameter along with power-law degree distribution are observed and investigated in literature. Taking an inspiration from these findings, we propose a deterministic complex network model, which we call Self-Coordinated Corona Graphs (SCCG), based on the corona product of graphs. As it has also been established that self coordination/organi...

A total coloring of a graph is an assignment of colors to all the elements (vertices and edges) of the graph such that no two adjacent or incident elements receive the same color. In this paper, we prove the tight bound of the Behzad and Vizing conjecture on total coloring for the corona product of two graphs G and H , when H is a cycle, a complete graph or a bipartite graph.

this paper describes the impact of the distance and the size of the corona ring, on the magnitude anddistribution of electrical potential across the polymer insulators. the procedure is based on finiteelement method numerical analysis and stochastic optimization algorithm of differential evolution(de). the optimal selection of corona ring has a significant impact on the control of potential and...

The multiplicative sum Zagreb index is defined for a simple graph G as the product of the terms dG(u)+dG(v) over all edges uv∈E(G) , where dG(u) denotes the degree of the vertex u of G . In this paper, we present some lower bounds for the multiplicative sum Zagreb index of several graph operations such as union, join, corona product, composition, direct product, Cartesian product and strong pro...

For an ordered set W = {w1, w2, · · · , wk} of vertices and a vertex v in a connected graph G, the representation of v with respect to W is the ordered k-tuple r(v|W ) = (d(v, w1), d(v, w2), · · · , d(v, wk)) where d(x, y) represents the distance between the vertices x and y. The set W is called a resolving set for G if every vertex of G has a distinct representation. A resolving set containing...

A new interaction is derived, which is important only when photons penetrate a hot, sparse electron plasma. When photons penetrate a cold and dense electron plasma, they lose energy through ionization and excitation, through Compton scattering on the individual electrons, and through Raman scattering on the plasma frequency. But when the plasma is very hot and has low density, such as in the so...

We present an analytic description of turbulent, magnetohydrodynamic (MHD) disk accretion around black holes that specifically addresses the relationship between radial and vertical, mean-field transport of mass, momentum and energy, thereby complementing and extending numerical simulations. The azimuthal-vertical component of the magnetic stress is fundamental to an understanding of disk– coro...

The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...