OMS-Vol. 2 (2018), Issue 1, pp. 156–163 Open Access Full-Text PDF

Abstract:In this paper we have presented a new method to compute the determinant of a \(5\times5\) matrix.

OMS-Vol. 2 (2018), Issue 1, pp. 146–155 | Open Access Full-Text PDF

Abstract:In this paper, some inequalities related to Čebyšev’s functional are proved.

OMS-Vol. 2 (2018), Issue 1, pp. 134–145 | Open Access Full-Text PDF

Abstract:For any graph \(G=(V,E)\), lict graph \(\eta(G)\) of a graph \(G\) is the graph whose vertex set is the union of the set of edges and the set of cut-vertices of \(G\) in which two vertices are adjacent if and only if the corresponding edges are adjacent or the corresponding members of \(G\) are incident. A secure lict dominating set of a graph \(\eta(G)\) , is a dominating set \(F \subseteq V(\eta(G))\) with the property that for each \(v_{1} \in (V(\eta(G))-F)\), there exists \(v_{2} \in F\) adjacent to \(v_{1}\) such that \((F-\lbrace v_{2}\rbrace) \cup \lbrace v_{1} \rbrace\) is a dominating set of \(\eta(G)\). The secure lict dominating number \(\gamma_{se}(\eta(G))\) of \(G\) is a minimum cardinality of a secure lict dominating set of \(G\). In this paper many bounds on \(\gamma_{se}(\eta(G))\) are obtained and its exact values for some standard graphs are found in terms of parameters of \(G\). Also its relationship with other domination parameters is investigated.