If is a simple connected graph with the vertex set and the edge set , S is a subset of , and let be the set of neighbors of S in . Then, the differential of S is defined as . The differential of G, denoted by , is the maximum value of for all subsets . The graph operator is defined as the graph that results by subdividing every edge of G once and joining pairs of these new vertices iff their corresponding edges are incident in G. In this paper, we study the relations between and . Besides, we exhibit some results relating the differential and well-known graph invariants, such as the domination number, the independence number, and the vertex-cover number.
We use a conformable fractional derivative through two kernels and in order to model the alcohol concentration in blood; we also work with the conformable Gaussian differential equation (CGDE) of this model, to evaluate how the curve associated with such a system adjusts to the data corresponding to the blood alcohol concentration. As a practical application, using the symmetry of the solution associated with the CGDE, we show the advantage of our conformable approaches with respect to the usual ordinary derivative.
Let G = (V (G), E(G)) be a simple graph with vertex set V (G) and edge set E(G). Let S be a subset of V (G), and let B(S) be the set of neighbours of S in V (G)∖S. The differential ∂(S) of S is the number |B(S)|−|S|. The maximum value of ∂(S) taken over all subsets S⊆V (G) is the differential ∂(G) of G. The graph R(G) is defined as the graph obtained from G by adding a new vertex ve for each e∈E(G), and by joining ve to the end vertices of e. In this paper we study the relationship between ∂(G) and ∂(R(G)), and give tight asymptotic bounds for ∂(R(G)). We also exhibit some relationships between certain vertex sets of G and R(G) which involve well known graph theoretical parameters.
Transitivity on graphs is a concept widely investigated. This suggest to analyze the action of automorphisms on other sets. In this paper, we study the action on the family of -sets (minimum dominating sets), the graph is called -transitive if given two -sets there exists an automorphism which maps one onto the other. We deal with two families: paths and cycles . Their -sets are fully characterized and the action of the automorphism group on the family of -sets is fully analyzed.
Let be a simple connected graph with more than one vertex, without loops or multiple edges. A nonempty subset is a global offensive alliance if every vertex satisfies that . The global offensive alliance number is defined as the minimum cardinality among all global offensive alliances. Let R be a finite commutative ring with identity. In this paper, we study the global offensive alliance number of the zero-divisor graph .