In this paper, we revisit the concept of (normalized) closeness centrality a vertex in graph and investigate it some graphs under operations. Specifically, derive formulas that compute vertices shadow graph, complementary prism, edge corona, disjunction graphs.

Clique counts reveal important properties about the structure of massive graphs, especially social networks. The simple setting of just 3-cliques (triangles) has received much attention from the research community. For larger cliques (even, say 6-cliques) the problem quickly becomes intractable because of combinatorial explosion. Most methods used for triangle counting do not scale for large cl...

This new topological invariant is applied in the areas of chemical graph theory. In this paper we have obtained Sombor index m−shadow graphs path Dm(Pn), cycle Dm(Cn), ladder Dm(Ln) and tadpole Dm(Tn,p). We also concluded that, m-shadow any regular or finite connected G SO(G)m3

In shadow volume rendering, the shadow volume silhouette edges are used to create primitives that model the shadow volume. A common misconception is that the vertices on such silhouettes can only be connected to two silhouette edges, i.e., have degree two. Furthermore, some believe that the degree of such a vertex can have any degree. In this short note, we present a geometric proof that shows ...

Shadow banking is a term that came out of the financial crisis of 2007-2009. There is a belief that shadow banking was one of the crisis reasons. Because the excessive expansion of shadow banking endangers the financial stability of countries, this paper examines the impact of shadow banking on financial stability using data from 14 countries of the G20 during 2002-2018. We divided countries in...

This paper presents an efficient approach for moving objects detection and shadow removal from color videos obtained using stationary camera. A background subtraction technique based on modified adaptive GMM has been proposed for detecting moving objects. Speed-up techniques have also been applied to enhance the computational efficiency of the algorithm. Then, a robust algorithm for shadow remo...

In this paper we solve three equivalent problems. The first is: what $3$-uniform hypergraph on a ground set of size $n$, having at least $e$ edges, has the most $2$-independent sets? Here is subset vertices containing fewer than $2$ from each edge. This to problem determining for which $\partial^+(\partial_2(\mathcal{H}))$ minimized. $\partial_2({\cdot})$ down-shadow level $2$, and $\partial^+(...