Transactions on CombinatoricsTransactions on Combinatorics
http://toc.ui.ac.ir/
Sun, 16 Dec 2018 12:18:30 +0100FeedCreatorTransactions on Combinatorics
http://toc.ui.ac.ir/
Feed provided by Transactions on Combinatorics. Click to visit.On the minimum stopping sets of product codes
http://toc.ui.ac.ir/article_22519_4082.html
It is shown that the certain combinatorial structures called stopping sets have the important role in analysis of iterative decoding. In this paper, the number of minimum stopping sets of a product code is determined by the number of the minimum stopping sets of the corresponding component codes. As an example, the number of minimum stopping sets of the r-dimensional SPC product code is computed.Fri, 30 Nov 2018 20:30:00 +0100A note on $1$-factorizability of quartic supersolvable Cayley graphs
http://toc.ui.ac.ir/article_22706_4082.html
Alspach et al‎. ‎conjectured that every quartic Cayley graph on an even solvable group is $1$-factorizable‎. ‎In this paper‎, ‎we verify this conjecture for quartic Cayley graphs on supersolvable groups of even order‎.Fri, 30 Nov 2018 20:30:00 +0100Degree resistance distance of trees with some given parameters
http://toc.ui.ac.ir/article_22876_4082.html
The degree resistance distance of a graph $G$ is defined as $D_R(G)=sum_{i<j}(d(v_i)+d(v_j))R(v_i,v_j)$, where $d(v_i)$ is the degree of the vertex $v_i$, and $R(v_i,v_j)$ is the resistance distance between the vertices $v_i$ and $v_j$. Here we characterize the extremal graphs with respect to degree resistance distance among trees with given diameter, number of pendent vertices, independence number, covering number, and maximum degree, respectively.Fri, 30 Nov 2018 20:30:00 +0100Refinements of the bell and stirling numbers
http://toc.ui.ac.ir/article_22859_4082.html
‎‎We introduce new refinements of the Bell‎, ‎factorial‎, ‎and unsigned Stirling numbers of the first and second kind that unite the derangement‎, ‎involution‎, ‎associated factorial‎, ‎associated Bell‎, ‎incomplete Stirling‎, ‎restricted factorial‎, ‎restricted Bell‎, ‎and $r$-derangement numbers (and probably more!)‎. ‎By combining methods from analytic combinatorics‎, ‎umbral calculus‎, ‎and probability theory‎, ‎we derive several recurrence relations and closed form expressions for these numbers‎. ‎By specializing our results to the classical case‎, ‎we recover explicit formulae for the Bell and Stirling numbers as sums over compositions‎.Fri, 30 Nov 2018 20:30:00 +0100Directed zero-divisor graph and skew power series rings
http://toc.ui.ac.ir/article_23009_4082.html
‎Let $R$ be an associative ring with identity and $Z^{ast}(R)$ be its set of non-zero zero-divisors‎. ‎Zero-divisor graphs of rings are well represented in the literature of commutative and non-commutative rings‎. ‎The directed zero-divisor graph of $R$‎, ‎denoted by $Gamma{(R)}$‎, ‎is the directed graph whose vertices are the set of non-zero zero-divisors of $R$ and for distinct non-zero zero-divisors $x,y$‎, ‎$xrightarrow y$ is an directed edge if and only if $xy=0$‎. ‎In this paper‎, ‎we connect some graph-theoretic concepts with algebraic notions‎, ‎and investigate the interplay between the ring-theoretical properties of a skew power series ring $R[[x;alpha]]$ and the graph-theoretical properties of its directed zero-divisor graph $Gamma(R[[x;alpha]])$‎. ‎In doing so‎, ‎we give a characterization of the possible diameters of $Gamma(R[[x;alpha]])$ in terms of the diameter of $Gamma(R)$‎, ‎when the base ring $R$ is reversible and right Noetherian with an‎ ‎$alpha$-condition‎, ‎namely $alpha$-compatible property‎. ‎We also provide many examples for showing the necessity of our assumptions‎.Fri, 30 Nov 2018 20:30:00 +0100