A connected graph \(G\) is said to be odd path extendable if for any odd path \(P\) of \(G\), the graph \(G – V(P)\) contains a perfect matching. In this paper, we at first time introduce the concept of odd path extendable graphs. Some simple necessary and sufficient conditions for a graph to be odd path extendable are given. In particular, we show that if a graph is odd path extendable, it is hamiltonian.

In this paper, we give one construction for constructing large harmonious graphs from smaller ones. Subsequently, three families of graphs are introduced and some members of them are shown to be or not to be harmonious.

A graph is called set reconstructible if it is determined uniquely (up to isomorphism) by the set of its vertex-deleted subgraphs. We prove that all graphs are set reconstructible if all \(2\)-connected graphs \(G\) with \(diam(G) = 2\) and all \(2\)-connected graphs \(G\) with \(diam(G) = diam(\overline{G}) = 3\) are set reconstructible.

A function \(f: V(G) \to \{-1,0,1\}\) defined on the vertices of a graph \(G\) is a minus total dominating function (MTDF) if the sum of its function values over any open neighborhood is at least one. That is, for every \(v \in V\), \(f(N(v)) \geq 1\), where \(N(v)\) consists of every vertex adjacent to \(v\). The weight of a MTDF is the sum of its function values over all vertices. A MTDF \(f\) is minimal if there does not exist a MTDF \(g: V(G) \to \{-1,0,1\}\), \(f \neq g\), for which \(g(v) \leq f(v)\) for every \(v \in V\). The upper minus total domination number, denoted by \(\Gamma^{-}_{t}(G)\), of \(G\) is the maximum weight of a minimal MTDF on \(G\). A function \(f: V(G) \to \{-1,1\}\) defined on the vertices of a graph \(G\) is a signed total dominating function (STDF) if the sum of its function values over any open neighborhood is at least one. The signed total domination number, denoted by \(\gamma^{s}_{t}(G)\), of \(G\) is the minimum weight of a STDF on \(G\). In this paper, we establish an upper bound on \(\Gamma^{-}_{t}(G)\) of the 5-regular graph and characterize the extremal graphs attaining the upper bound. Also, we exhibit an infinite family of cubic graphs in which the difference \(\Gamma^{-}_t(G) – \gamma^{s}_t(G)\) can be made arbitrarily large.

Let \(G\) be a graph with vertex set \(V(G)\). An edge coloring \(C\) of \(G\) is called an edge-cover coloring, if for each color, the edges assigned with it form an edge cover of \(G\). The maximum positive integer \(k\) such that \(G\) has a \(k\)-edge-cover coloring is called the edge cover chromatic index of \(G\) and is denoted by \(\chi’_c(G)\). It is well known that \(\min\{d(v) – \mu(v) : v \in V(G)\} \leq \chi’_c(G) \leq \delta(G)\), where \(\mu(v)\) is the multiplicity of \(v\) and \(\delta(G)\) is the minimum degree of \(G\). If \(\chi’_c(G) = \delta(G)\), \(G\) is called a graph of CI class, otherwise \(G\) is called a graph of CII class. In this paper, we give a new sufficient condition for a nearly bipartite graph to be of CI class.