Search

Given a $t$-$(v, k, \lambda)$ design, $\mathcal{D}=(X,\mathcal{B})$, a zero-sum $n$-flow of $\mathcal{D}$ is a map $f : \mathcal{B}\longrightarrow \{\pm1,\ldots, \pm(n-1)\}$ such that for any point $x\in X$, the sum of $f$ over all blocks incident with $x$ is zero. For a positive integer $k$, we find a zero-sum $k$-flow for an STS$(u w)$ and for an STS$(2v+7)$ for $v\equiv 1~(\mathrm{mod}~4)$, if there are STS$(u)$, STS$(w)$ and STS$(v)$ such that the STS$(u)$ and STS$(v)$ both have a zero-sum $k$-flow. In 2015, it was conjectured that for $v>7$ every STS$(v)$ admits a zero-sum $3$-flow. Here, it is shown that many cyclic STS$(v)$ have a zero-sum $3$-flow. Also, we investigate the existence of zero-sum flows for some Steiner quadruple systems.

A signed graph is said to be sign-symmetric if it is switching isomorphic to its negation. Bipartite signed graphs are trivially sign-symmetric. We give new constructions of non-bipartite sign-symmetric signed graphs. Sign-symmetric signed graphs have a symmetric spectrum but not the other way around. We present constructions of signed graphs with symmetric spectra which are not sign-symmetric. This, in particular answers a problem posed by Belardo, Cioab\u{a}, Koolen, and Wang (2018).

The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least 2 and $S\subseteq V(G)$, the Steiner distance $d_G(S)$ of the set $S$ of vertices in $G$ is the minimum size of a connected subgraph whose vertex set contains or connects $S$. In this paper, we introduce the concept of the Steiner (revised) Szeged index ($rSz_k(G)$) $Sz_k(G)$ of a graph $G$, which is a natural generalization of the well-known (revised) Szeged index of chemical use. We determine the $Sz_k(G)$ for trees in general. Then we give a formula for computing the Steiner Szeged index of a graph in terms of orbits of automorphism group action on the edge set of the graph. Finally, we give sharp upper and lower bounds of ($rSz_k(G)$) $Sz_k(G)$ of a connected graph $G$, and establish some of its properties. Formulas of ($rSz_k(G)$) $Sz_k(G)$ for small and large $k$ are also given in this paper., Comment: 12 pages

A vertex subset $S$ of a graph $G$ is a general position set of $G$ if no vertex of $S$ lies on a geodesic between two other vertices of $S$. The cardinality of a largest general position set of $G$ is the general position number (gp-number) ${\rm gp}(G)$ of $G$. The gp-number is determined for some families of Kneser graphs, in particular for $K(n,2)$ and $K(n,3)$. A sharp lower bound on the gp-number is proved for Cartesian products of graphs. The gp-number is also determined for joins of graphs, coronas over graphs, and line graphs of complete graphs.

A signed graph $\Gamma$ is said to be determined by its spectrum if every signed graph with the same spectrum as $\Gamma$ is switching isomorphic with $\Gamma$. Here it is proved that the path $P_n$, interpreted as a signed graph, is determined by its spectrum if and only if $n\equiv 0, 1$, or 2 (mod 4), unless $n\in\{8, 13, 14, 17, 29\}$, or $n=3$.

For a graph $G=(V,E)$ of order $n$, a Roman $\{2\}$-dominating function $f:V\rightarrow\{0,1,2\}$ has the property that for every vertex $v\in V$ with $f(v)=0$, either $v$ is adjacent to a vertex assigned $2$ under $f$, or $v$ is adjacent to least two vertices assigned $1$ under $f$. In this paper, we classify all graphs with Roman $\{2\}$-domination number belonging to the set $\{2,3,4,n-2,n-1,n\}$. Furthermore, we obtain some results about Roman $\{2\}$-domination number of some graph operations., Comment: 9 pages, 2 figures

Let $R$ be a commutative ring with $\Z(R)$ its set of zero-divisors. In this paper, we study the total graph of $R$, denoted by $\T(\Gamma(R))$. It is the (undirected) graph with all elements of $R$ as vertices, and for distinct $x, y\in R$, the vertices $x$ and $y$ are adjacent if and only if $x + y\in\Z(R)$. We investigate properties of the total graph of $R$ and determine all isomorphism classes of finite commutative rings whose total graph has genus at most one (i.e., a planar or toroidal graph). In addition, it is shown that, given a positive integer $g$, there are only finitely many finite rings whose total graph has genus $g$., Comment: 7 pages. To appear in Rocky Mountain Journal of Mathematics

Let $R$ be a commutative ring with identity. Let $\Gamma(R)$ be a graph with vertices as elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if $Ra+Rb=R$. In this paper we consider a subgraph $\Gamma_2(R)$ of $\Gamma(R)$ which consists of non-unit elements. We look at the connectedness and the diameter of this graph. We completely characterize the diameter of the graph $\Gamma_2(R)\setminus\J(R)$. In addition, it is shown that for two finite semi-local rings $R$ and $S$, if $R$ is reduced, then $\Gamma(R)\cong\Gamma(S)$ if and only if $R\cong S$., Comment: 8 Pages

Let $R$ be a commutative ring with identity and let $I$ be an ideal of $R$. Let $R\Join I$ be the subring of $R\times R$ consisting of the elements $(r,r+i)$ for $r\in R$ and $i\in I$. We study the diameter and girth of the zero-divisor graph of the ring $R\Join I$., Comment: 9 pages

For a commutative semigroup $S$ with 0, the zero-divisor graph of $S$ denoted by $\Gamma(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 $\Gamma(S)$ is complete $r$-partite for a positive integer $r$. Also we study the commutative semigroups which are finitely colorable., Comment: 11 pages