Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of total dominating set in $G$ and denoted by $gamma_t(G)$. The total domination polynomial of $G$ is the polynomial $D_t(G,x)=sum d_t(G,i)$, where $d_t(G,i)$ is the numbe...

Cycle multiplicity of a graph G is the maximum number edge disjoint cycles in G. In this paper, we determine cycle and then obtain formula total complete bipartite graph, generalizes result for, which given by M.M. Akbar Ali [1].

in this paper, we introduce the (g-$psi$) contraction in a metric space by using a graph.let $f,t$ be two multivalued mappings on $x.$ among other things, we obtain a common fixedpoint of the mappings $f,t$ in the metric space $x$ endowed with a graph $g.$

for a graph $g$ with edge set $e(g)$, the multiplicative sum zagreb index of $g$ is defined as$pi^*(g)=pi_{uvin e(g)}[d_g(u)+d_g(v)]$, where $d_g(v)$ is the degree of vertex $v$ in $g$.in this paper, we first introduce some graph transformations that decreasethis index. in application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum zagreb ...

In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.

jachymski [ proc. amer. math. soc., 136 (2008), 1359-1373] gave modified version of a banach fixed point theorem on a metric space endowed with a graph. in the present paper, (g, φ)-graphic contractions have been de ned by using a comparison function and studied the existence of fixed points. also, hardy-rogers g-contraction have been introduced and some fixed point theorems have been proved. s...

let $k$ be a positive integer. a subset $s$ of $v(g)$ in a graph $g$ is a $k$-tuple total dominating set of $g$ if every vertex of $g$ has at least $k$ neighbors in $s$. the $k$-tuple total domination number $gamma _{times k,t}(g)$ of $g$ is the minimum cardinality of a $k$-tuple total dominating set of $g$. if$v(g)=v^{0}={v_{1}^{0},v_{2}^{0},ldots ,v_{n}^{0}}$ and $e(g)=e_{0}$, then for any in...

A spectral sparsifier of a graph G is a sparser graph H that approximately preserves the quadratic form of G, i.e. for all vectors x, xLGx ≈ x T LHx, where LG and LH denote the respective graph Laplacians. Spectral sparsifiers generalize cut sparsifiers, and have found many applications in designing graph algorithms. In recent years, there has been interest in computing spectral sparsifiers in ...

Let $G$ be a $(p,q)$ graph. Let $f:V(G)to{1,2, ldots, k}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $gcd(f(u),f(v))$. $f$ is called $k$-Total prime cordial labeling of $G$ if $left|t_{f}(i)-t_{f}(j)right|leq 1$, $i,j in {1,2, cdots,k}$ where $t_{f}(x)$ denotes the total number of vertices and the edges labelled with $x$. A graph with a $k$-total prime cordi...