The spatio-spectral total variation (SSTV) model has been widely used as an effective regularization of hyperspectral images (HSI) for various applications such mixed noise removal. However, since SSTV computes local spatial differences uniformly, it is difficult to remove while preserving complex structures with fine edges and textures, especially in situations high intensity. To solve this pr...

In this paper we learn the new idea of forcing total outer independent edge geodetic number a graph. Let G be connected graph and R minimum set G. A subset L ⊆ is known as for if unique containing L. cardinality R. The denoted by (G) = min , where taken over all in Some general properties satisfied concept are studied. It shown that any couple integers l, m with0 < l ≤ − 4, there exists such .

‎the second multiplicative zagreb coindex of a simple graph $g$ is‎ ‎defined as‎: ‎$${overline{pi{}}}_2left(gright)=prod_{uvnotin{}e(g)}d_gleft(uright)d_gleft(vright),$$‎ ‎where $d_gleft(uright)$ denotes the degree of the vertex $u$ of‎ ‎$g$‎. ‎in this paper‎, ‎we compare $overline{{pi}}_2$-index with‎ ‎some well-known graph invariants such as the wiener index‎, ‎schultz‎ ‎index‎, ‎eccentric co...

the k-th semi total point graph of a graph g, , ‎is a graph‎ obtained from g by adding k vertices corresponding to each edge and‎ connecting them to the endpoints of edge considered‎. ‎in this paper‎, a formula for laplacian polynomial of in terms of‎ characteristic and laplacian polynomials of g is computed‎, ‎where is a connected regular graph‎.the kirchhoff index of is also computed‎.

A graph G that has a perfect matching is n-extendable if every matching of size n lies in a perfect matching of G. We show that when the connectivity of a line graph, power graph, or total graph is sufficiently large then it is n-extendable. Specifically: if G has even size and is (2n + 1)edge-connected or (n + 2)-connected, then its line graph is n-extendable; if G has even order and is (n + 1...

The total chromatic number of a graph G, denoted by χ′′(G), is the minimum number of colors needed to color the vertices and edges of G such that no two adjacent or incident elements get the same color. It is known that if a planar graph G has maximum degree ∆ > 9, then χ′′(G) = ∆ + 1. The join K1 ∨ Pn of K1 and Pn is called a fan graph Fn. In this paper, we prove that if G is an F5-free planar...