Results 21 to 30 of about 110,665 (282)
Computing Wiener and Hyper-Wiener Indices of Zero-Divisor Graph of ℤℊ3×ℤI1I2
Journal of Function Spaces, 2022 Let S=ℤℊ3×ℤI1I2 be a commutative ring where ℊ,I1 and I2 are positive prime integers with I1≠I2. The zero-divisor graph assigned to S is an undirected graph, denoted as YS with vertex set V(Y(S)) consisting of all Zero-divisor of the ring S and for any c,
Yonghong Liu +4 more
doaj +1 more source
Polynomial Invariants of Graphs [PDF]
Transactions of the American Mathematical Society, 1987 We define two polynomials f ( G ) f(G) and f ∗ ( G ) {f^{\ast }}(G) for a graph G G by a recursive formula with respect to deformation of graphs.
openaire +2 more sources
On fully split lacunary polynomials in finite fields [PDF]
, 2011 We estimate the number of possible types degree patterns of $k$-lacunary polynomials of degree $t < p$ which split completely modulo $p$. The result is based on a combination of a bound on the number of zeros of lacunary polynomials with some graph ...
Bibak, Khodakhast, Shparlinski, Igor E.
core +1 more source
ISRN Algebra, 2011 One of the most important and applied concepts in graph theory is to find the edge cover, vertex cover, and dominating sets with minimum cardinal also to find independence and matching sets with maximum cardinal and their polynomials. Although there exist some algorithms for finding some of them (Kuhn and Wattenhofer, 2003; and Mihelic and Robic, 2005),
Mehdi Alaeiyan, Saeid Mohammadian
openaire +1 more source
Polynomial hulls of graphs [PDF]
Pacific Journal of Mathematics, 1991 We consider the polynomially convex hull of the graph of a continuous complex-valued function on the boundary of the unit ball. We show first that the hull covers the closed unit ball and then consider several of its properties. In particular, when is the hull also a graph; i.e. single sheeted?
openaire +3 more sources
A bivariate chromatic polynomial for signed graphs [PDF]
, 2014 We study Dohmen--P\"onitz--Tittmann's bivariate chromatic polynomial $c_\Gamma(k,l)$ which counts all $(k+l)$-colorings of a graph $\Gamma$ such that adjacent vertices get different colors if they are $\le k$.
Beck, Matthias, Hardin, Mela
core +1 more source
RC-Graphs and Schubert Polynomials [PDF]
Experimental Mathematics, 1993 Using a formula of Billey, Jockusch and Stanley, Fomin and Kirillov have introduced a new set of diagrams that encode the Schubert polynomials. We call these objects rc-graphs. We define and prove two variants of an algorithm for constructing the set of all rc-graphs for a given permutation.
Bergeron, Nantel, Billey, Sara
openaire +2 more sources
On coefficients of circuit polynomials and characteristic polynomials
International Journal of Mathematics and Mathematical Sciences, 1985 Results are given from which expressions for the coefficients of the simple circuit polynomial of a graph can be obtained in terms of subgraphs of the graph. From these are deduced parallel results for the coefficients of the characteristic polynomial of
E. J. Farrell
doaj +1 more source
Topological invariants for the line graphs of some classes of graphs
Open Chemistry, 2019 Graph theory plays important roles in the fields of electronic and electrical engineering. For example, it is critical in signal processing, networking, communication theory, and many other important topics.
Zhou Xiaoqing +5 more
doaj +1 more source
Omega, Sadhana, and PI Polynomials of Quasi-Hexagonal Benzenoid Chain
Journal of Analytical Methods in Chemistry, 2020 Counting polynomials are important graph invariants whose coefficients and exponents are related to different properties of chemical graphs. Three closely related polynomials, i.e., Omega, Sadhana, and PI polynomials, dependent upon the equidistant edges
Nazeran Idrees +5 more
doaj +1 more source