A simple graph \( G(V, E) \) is called \( A \)-magic if there is a labeling \( f: E \to A^* \), where \( A \) is an Abelian group and \( A^* = A – \{0\} \), such that the induced vertex labeling \( f^*: V \to A \), defined as \( f^*(v) = \sum_{u \in N(v)} f(uv) = k \), for every \( v \in V \), is a constant in \( A \). In this paper, we show constructions of new classes of \( A \)-magic graphs from known \( A \)-magic graphs using labeling matrices.

For an ordered set \( W = \{w_1, w_2, \dots, w_k\} \) of vertices and a vertex \( v \) in a connected graph \( G \), the representation of \( v \) with respect to \( W \) is the ordered \( k \)-tuple \( r(v|W) = (d(v, w_1), d(v, w_2), \dots, d(v, w_k)) \) where \( d(x,y) \) represents the distance between the vertices \( x \) and \( y \). The set \( W \) is called a resolving set for \( G \) if every two vertices of \( G \) have distinct representations. A resolving set containing a minimum number of vertices is called a basis for \( G \). The dimension of \( G \), denoted by \( \text{dim}(G) \), is the number of vertices in a basis of \( G \). In this paper, we determine the dimensions of some corona graphs \( G \odot K_1 \), \( G \odot \overline{K}_m \) for any graph \( G \) and \( m \geq 2 \), and a graph with pendant edges more general than corona graphs \( G \odot \overline{K}_m \).

Let \( G = (V, E) \) be a simple, finite, and undirected graph. A sum labeling is a one-to-one mapping \( L \) from a set of vertices of \( G \) to a finite set of positive integers \( S \) such that if \( u \) and \( v \) are vertices of \( G \), then \( uv \) is an edge in \( G \) if and only if there is a vertex \( w \) in \( G \) and \( L(w) = L(u) + L(v) \). A graph \( G \) that has a sum labeling is called a sum graph. The minimal isolated vertex that is needed to make \( G \) a sum labeling is called the sum number of \( G \), denoted as \( \sigma(G) \). The sum number of a sum graph \( G \) is always greater than or equal to \( \delta(G) \), the minimum degree of \( G \). An optimum sum graph is a sum graph that has \( \sigma(G) = \delta(G) \). In this paper, we discuss sum numbers of finite unions of some families of optimum sum graphs, such as cycles and friendship graphs.

Let \( G = (V, E) \) be a simple and undirected graph with \( v \) vertices and \( e \) edges. An \( (a, d) \)-\({edge-antimagic\; total\; labeling}\) is a bijection \( f \) from \( V(G) \cup E(G) \) to the set of consecutive integers \( \{1, 2, \dots, v + e\} \) such that the weights of the edges form an arithmetic progression with initial term \( a \) and common difference \( d \). A super \( (a, d) \)-\({edge\; antimagic \;total \;labeling}\) is an edge antimagic total labeling \( f \) such that \( f(V(G)) = \{1, \dots, v\} \). In this paper, we solve some problems on edge antimagic total labeling, such as on paths and unicyclic graphs.

We investigate the critical set of edge-magic labeling on caterpillar graphs and its application on secret sharing schemes. We construct a distribution scheme based on supervisory secret sharing schemes, which use the notion of critical sets to distribute the shares and reconstruct the key.

For given graphs \( G \) and \( H \), the Ramsey number \( R(G, H) \) is the least natural number \( n \) such that for every graph \( F \) of order \( n \) the following condition holds: either \( F \) contains \( G \) or the complement of \( F \) contains \( H \). In this paper, we improve the Ramsey number of paths versus Jahangirs. We also determine the Ramsey number \( R(\cup G, H) \), where \( G \) is a path and \( H \) is a Jahangir graph.

A total vertex irregular labeling of a graph G with v vertices and e edges is an assignment of integer labels to both vertices and edges so that the weights calculated at vertices are distinct.The total vertex irregularity strength of \(G\), denoted by \(tvs(G)\), is the minimum value of the largest label over all such irregular assignments.In this paper, we consider the total vertex irregular labelings of wheels W_n, fans \(F_n\), suns \(S_n\) and friendship graphs \(f_n\).We show that \(tvs(W_n) = \lceil \frac{n+3}{4} \rceil \text{ for } n \geq 3\),\(tvs(F_n) = \lceil \frac{n+2}{4} \rceil \text{ for } n \geq 3\),\(tvs(S_n) = \lceil\frac{n+1}{2} \rceil \text{ for } n \geq 3\),\(tvs(f_n) = \lceil \frac{2n+2}{3} \rceil \text{ for all } n\).

A graph is called supermagic if it admits a labeling of its edges by consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we prove that the necessary conditions for an \(r\)-regular supermagic graph of order \(n\) to exist are also sufficient. All proofs are constructive and they are based on finding supermagic labelings of circulant graphs.A parameterized system consists of several similar processes whose number is determined by an input parameter. A challenging problem is to provide methods for the uniform verification of such systems, i.e., to show by a single proof that a system is correct for any value of the parameter.

This paper presents a method for verifying parameterized systems using predicate diagrams. Basically, predicate diagrams are graphs whose vertices are labelled with first-order formulas, representing sets of system states, and whose edges represent possible system transitions. These diagrams are used to represent the abstractions of parameterized systems described by specifications written in temporal logic.

This presented method integrates deductive verification and algorithmic techniques. Non-temporal proof obligations establish the correspondence between the original specification and the diagram, whereas model checking is used to verify properties over finite-state abstractions.

For any given graphs \( G \) and \( H \), we write \( F \rightarrow (G, H) \) to mean that any red-blue coloring of the edges of \( F \) contains a red copy of \( G \) or a blue copy of \( H \). A graph \( F \) is \((G, H)\)-minimal (Ramsey-minimal) if \( F \rightarrow (G, H) \) but \( F^* \not\rightarrow (G, H) \) for any proper subgraph \( F^* \subset F \). The class of all \((G, H)\)-minimal graphs is denoted by \( \mathcal{R}(G, H) \). In this paper, we will determine the graphs in \( \mathcal{R}(K_{1,2}, C_4) \).

Let \( G \) be a connected graph. For a vertex \( v \in V(G) \) and an ordered \( k \)-partition \( \Pi = (S_1, S_2, \dots, S_k) \) of \( V(G) \), the representation of \( v \) with respect to \( \Pi \) is the \( k \)-vector \( r(v|\Pi) = (d(v, S_1), d(v, S_2), \dots, d(v, S_k) ) \) where \( d(v, S_i) = \min_{w \in S_i} d(x, w) \) (\( 1 \leq i \leq k \)). The \( k \)-partition \( \Pi \) is said to be resolving if the \( k \)-vectors \( r(v|\Pi) \), \( v \in V(G) \), are distinct. The minimum \( k \) for which there is a resolving \( k \)-partition of \( V(G) \) is called the partition dimension of \( G \), denoted by \( pd(G) \). A resolving \( k \)-partition \( \Pi = \{ S_1, S_2, \dots, S_k \} \) of \( V(G) \) is said to be connected if each subgraph \( \langle S_i \rangle \) induced by \( S_i \) (\( 1 \leq i \leq k \)) is connected in \( G \). The minimum \( k \) for which there is a connected resolving \( k \)-partition of \( V(G) \) is called the connected partition dimension of \( G \), denoted by \( cpd(G) \). In this paper, the connected partition dimension of the unicyclic graphs is calculated and bounds are proposed.