For different properties \(\mathcal{P}\) of a connected graph \(G\), we characterize the connected graphs \(F\) (resp. the pairs \((X,Y)\) of connected graphs) such that \(G\) has Property \(\mathcal{P}\) if \(G\) does not admit \(F\) (resp. neither \(X\) nor \(Y\)) as an induced subgraph.We consider here the lower independence, domination, and irredundance parameters, which are related by the well-known inequalities \(ir \leq \gamma \leq i \leq \alpha \leq \Gamma \leq IR\), and the properties \(\mathcal{P}\) correspond to the equality between some
of these parameters.

Given that an array \(A[i_{1}, \ldots, i_{d}]\), \(1 \leq i_1 \leq m, \ldots 1 \leq i_d \leq m\), has a \({period}\) \(A[p_{1}, \ldots, p_{d}]\) of dimension \(p_1 \times \cdots p_{d}\) if \(A[i_{1}, \ldots, i_{d}] = A[i_{1} + p_{1}, \ldots, i_{d} + p_{d}]\) for \(i_{1}, \ldots, i_{d} = 1, \ldots, m – (p_{1}, \ldots, p_{d})\). The \({period}\) of the array is \(A[p_{1}, \ldots, p_{d}]\) for the shortest such \(q = p_{1}, \ldots, p_{d}\).Consider this array \(A\); we prove a lower bound on the computation of the period length less than \(m^{d}/2^d\) of \(A\) with time complexity
\[
\Omega({\log \log_a m}), \text{ where } a = m^{d^2}
\]
for \(O(m^d)\) work on the CRCW PRAM model of computation.

This paper contains a characterization of Baer \(^*\)-rings with finitely many elements in terms of matrix rings over finite fields. As an application, one can easily verify whether a given matrix ring over a finite field is a Baer \(^*\)-ring or not.

A function \(f: V \rightarrow \mathbb{R}\) is defined to be an \(\mathbb{R}\)-dominating function of graph \(G = (V, E)\) if the sum of the function values over any closed neighbourhood is at least 1. That is, for every \(v \in V\),
\(f(N(v) \cup \{v\}) \geq 1\).The \(\mathbb{R}\)-domination number \(\gamma_{\mathbb{R}}(G)\) of \(G\) is defined to be the infimum of \(f(V)\) taken over all \(\mathbb{R}\)-dominating functions \(f\) of \(G\).In this paper, we investigate necessary and sufficient conditions for \(\gamma_{\mathbb{R}}(G) = \gamma(G)\), where \(\gamma(G)\) is the standard domination number.

It is shown that the determinant of the variable adjacency matrix, and hence the determinant of the adjacency matrix of a graph, are circuit polynomials. From this, it is deduced that determinants of symmetric matrices are indeed circuit polynomials of associated graphs.The results are then extended to general matrices

In this paper, we consider three conjectures of the computer program GRAFFITI. Moreover, we prove that every connected graph with minimum degree \(\delta\) and diameter \(d_m\) contains a matching of size at least \(\frac{\delta(d_m + 1)}{6}\). This inequality improves one of the conjectures under the additional assumption that \(\delta \geq 6\).

Let \(G\) be a \(1\)-tough graph of order \(n\). If \(|N(S)| \geq \frac{n + |S| – 1}{3}\) for every non-empty subset \(S\) of the vertex set \(V(G)\) of \(G\), then \(G\) is hamiltonian.

We introduce generalized hooked, extended, and near-Skolem sequences and determine necessary conditions for their existence, the minimum number of hooks, and their permissible locations. We also produce computational results for small orders in each case.

Let \(H\) be a graph. An \(H\)-colouring of a graph \(G\) is an edge-preserving mapping of the vertices of \(G\) to the vertices of \(H\). We consider the Extendable \(H\)-colouring Problem, that is, the problem of deciding whether a partial \(H\)-colouring of some finite subset of the vertices of \(G\) can be extended to an \(H\)-colouring of \(G\). We show that, for a class of finitely described infinite graphs, Extendable \(H\)-colouring is undecidable for all finite non-bipartite graphs \(H\), and also for some finite bipartite graphs \(H\). Similar results are established when \(H\) is a finite reflexive graph.