hansen et‎. ‎al.‎, ‎using the autographix software ‎package‎, ‎conjectured that the szeged index $sz(g)$ and the‎ ‎wiener index $w(g)$ of a connected bipartite graph $g$ with $n geq ‎4$ vertices and $m geq n$ edges‎, ‎obeys the relation‎ ‎$sz(g)-w(g) geq 4n-8$‎. ‎moreover‎, ‎this bound would be the best possible‎. ‎this paper offers a proof to this conjecture‎.

In this paper, we determine the structures of zero-divisor semigroups whose graph is Kn + 1, the complete graph Kn together with an end vertex. We also present a formula to calculate the number of non-isomorphic zero-divisor semigroups corresponding to the complete graph Kn, for all positive integer n.

The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...

Baker and Norine introduced a graph-theoretic analogue of the Riemann-Roch theory. A central notion in this theory is the rank of a divisor. In this paper we prove that computing the rank of a divisor on a graph is NP-hard. The determination of the rank of a divisor can be translated to a question about a chip-firing game on the same underlying graph. We prove the NP-hardness of this question b...

For a commutative semigroup S with 0, the zero-divisor graph of S denoted by Γ(S) is the graph whose vertices are nonzero zero-divisor of S, and two vertices x, y are adjacent in case xy = 0 in S. In this paper we study the case where the graph Γ(S) is complete r-partite for a positive integer r. Also we study the commutative semigroups which are finitely colorable.

An almost-bipartite graph is a non-bipartite graph with the property that the removal of a particular single edge renders the graph bipartite. A graph labeling of an almost-bipartite graph G with n edges that yields cyclic G-decompositions of the complete graph K2nt+1 was recently introduced by Blinco, El-Zanati, and Vanden Eynden. They called such a labeling a γ-labeling. Here we show that the...

let $g$ be a simple graph with vertex set $v(g) = {v_1, v_2,ldots, v_n}$ and edge set $e(g) = {e_1, e_2,ldots , e_m}$. similar tothe randi'c matrix, here we introduce the randi'c incidence matrixof a graph $g$, denoted by $i_r(g)$, which is defined as the$ntimes m$ matrix whose $(i, j)$-entry is $(d_i)^{-frac{1}{2}}$ if$v_i$ is incident to $e_j$ and $0$ otherwise. naturally, therandi'c incidenc...

A metric graph is a geometric realization of a finite graph by identifying each edge with a real interval. A divisor on a metric graph Γ is an element of the free abelian group on Γ. The rank of a divisor on a metric graph is a concept appearing in the RiemannRoch theorem for metric graphs (or tropical curves) due to Gathmann and Kerber [7], and Mikhalkin and Zharkov [10]. We define a rank-dete...