Related papers: Generalized Irreducible Divisor Graphs
For a commutative domain $R$ with nonzero identity and $I$ an ideal of $R$, we say $a=\lambda b_1 \cdots b_k$ is a $\tau_I$-factorization of $a$ if $\lambda \in R$ is a unit and $b_i \equiv b_j$(mod $I$) for all $1\leq i \leq j \leq k$.…
The author \mbox{(Appl. Math. Comput. 218(3):860-865, 2011)} introduced a new fractional integral operator given by, \[ \big({}^\rho \mathcal{I}^\alpha_{a+}f\big)(x) = \frac{\rho^{1- \alpha }}{\Gamma({\alpha})} \int^x_a \frac{\tau^{\rho-1}…
Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…
In this paper we establish a formal connection between the structure of ideals in integers rings and the theory of additive combinatorics. For integers rings with cyclic class groups, we prove a structural theorem demonstrating that every…
This paper presents a generalization of our earlier work in [19]. In this paper, the two concepts, generic regular decomposition (GRD) and regular-decomposition-unstable (RDU) variety introduced in [19] for generic zero-dimensional systems,…
A graph is Cartesian decomposable if it is isomorphic to a Cartesian product of (more than one) strictly smaller graphs, each of which has more than one vertex and admits no such decomposition. These smaller graphs are called the…
For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…
In an influential 2008 paper, Baker proposed a number of conjectures relating the divisor theory of algebraic curves with an analogous combinatorial theory on finite graphs. In this note, we examine Baker's Brill--Noether existence…
The domination polynomial (the total domination polynomial) of a graph $ G $ of order $ n $ is the generating function of the number of dominating sets (total dominating sets) of $ G $ of any size. In this paper, we study the domination…
We study the undirected divisibility graph in which the vertex set is a finite subset of consecutive natural numbers up to N.We derive analytical expressions for measures of the graph like degree, clustering, geodesic distance and…
In this paper, we explore the concept of the ``matrix product of graphs," initially introduced by Prasad, Sudhakara, Sujatha, and M. Vinay. This operation involves the multiplication of adjacency matrices of two graphs with assigned labels,…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
Divisible design graphs were introduced in 2011 by Haemers, Kharaghani and Meulenberg. In this paper, we introduce the notion of $q$-analogs of divisible design graphs and show that all $q$-analogs of divisible design graphs come from…
Let C be an integral fusion category. We study some graphs, called the prime graph and the common divisor graph, related to the Frobenius-Perron dimensions of simple objects in the category C, that extend the corresponding graphs associated…
The paper presents a new formula for the fractional integration, which generalizes the Riemann-Liouville and Hadamard fractional integrals into a single form, which when a parameter fixed at different values, produces the above integrals as…
We provide a family of group measure space II_1 factors for which all finite index subfactors can be explicitly listed. In particular, the set of all indices of irreducible subfactors can be computed. Concrete examples show that this index…
A new method is introduced for bounding the separation between the value of $-k$ and the smallest eigenvalue of a non-bipartite $k$-regular graph. The method is based on fractional decompositions of graphs. As a consequence we obtain a very…
A graph embedded in the 3-sphere is called irreducible if it is non-splittable and for any 2-sphere embedded in the 3-sphere that intersects the graph at one point the graph is contained in one of the 3-balls bounded by the 2-sphere. We…
The author in [7] was proved the generalized remainder and quotient theorems of polynomial in one indeterminate where the divisor is complete factorization to linear factors. In this paper we give the formula for the generalized remainder…
Directed strongly regular graphs were introduced by Duval in 1998 as one of the possible generalization of classical strongly regular graphs to the directed case. Duval also provided several construction methods for directed strongly…