In this paper we introduce remainder cordial labeling of graphs. Let $G$ be a $(p,q)$ graph. Let $f:V(G)rightarrow {1,2,...,p}$ be a $1-1$ map. For each edge $uv$ assign the label $r$ where $r$ is the remainder when $f(u)$ is divided by $f(v)$ or $f(v)$ is divided by $f(u)$ according as $f(u)geq f(v)$ or $f(v)geq f(u)$. The function$f$ is called a remainder cordial labeling of $G$ if $left| e_{...

the hosoya index and the merrifield-simmons index are two types of graph invariants used in mathematical chemistry. in this paper, we give some formulas for computed these indices for some classes of corona product and link of two graphs. furthermore, we obtain exact formulas of hosoya and merrifield-simmons indices for the set of bicyclic graphs, caterpillars and dual star.

The Wiener index of a connected graph G, denoted by W(G) , is defined as ∑ ( , ) , ∈ ( ) .Similarly, hyper-Wiener index of a connected graph G,denoted by WW(G), is defined as ( ) + ∑ ( , ) , ∈ ( ) .In this paper, we present the explicit formulae for the Wiener, hyper-Wiener and reverse Wiener indices of some graph operations. Using the results obtained here, the exact formulae for Wiener, hyper...

let $g$ be a simple connected graph. the edge-wiener index $w_e(g)$ is the sum of all distances between edges in $g$, whereas the hyper edge-wiener index $ww_e(g)$ is defined as {footnotesize $w{w_e}(g) = {frac{1}{2}}{w_e}(g) + {frac{1}{2}} {w_e^{2}}(g)$}, where {footnotesize $ {w_e^{2}}(g)=sumlimits_{left{ {f,g} right}subseteq e(g)} {d_e^2(f,g)}$}. in this paper, we present explicit formula fo...

Let $G$ be a group. The order graph of $G$ is the (undirected)graph $Gamma(G)$,those whose vertices are non-trivial subgroups of $G$ and two distinctvertices $H$ and $K$ are adjacent if and only if either$o(H)|o(K)$ or $o(K)|o(H)$. In this paper, we investigate theinterplay between the group-theoretic properties of $G$ and thegraph-theoretic properties of $Gamma(G)$. For a finite group$G$, we s...

The Macro-star graph which has the star graph as a basic module has node symmetry, maximum fault tolerance, and hierarchical decomposition property. And, it is an interconnection network which improves a network cost against the star graph. A Matrix-star graph also has such a good properties of the Macro-star graph and is an interconnection network which has a lower network cost than the Macro-

In recent years, significant advances have been made in the design and evaluation of balanced (hyper)graph partitioning algorithms. We survey trends past decade practical algorithms for together with future research directions. Our work serves as an update to a previous on topic [ 29 ]. particular, extends by also covering hypergraph has additional focus parallel

We construct explicit minimal models for the (hyper)operads governing modular, cyclic and ordinary operads, wheeled properads, respectively. Algebras these are homotopy versions of corresponding structures.