Results 231 to 240 of about 5,134,655 (243)

The security number of lexicographic products

Quaestiones Mathematicae, 2017
A subset S of vertices of a graph G is a secure set if |N[X] ∩ S| ≥ |N[X]−S| holds for any subset X of S, where N[X] denotes the closed neighborhood of X. The minimum cardinality s(G) of a secure set in G is called the security number of G. We investigate the security number of lexicographic product graphs by defining a new concept of tightly-securable
Gologranc, Tanja, Jakovac, Marko, Peterin, Iztok   +2 more
openaire   +2 more sources

The reliability of lexicographic product digraphs

Applied Mathematics and Computation, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Qinghai, Hong, Yanmei
openaire   +2 more sources

Solution to a conjecture on resistance diameter of lexicographic product of paths

Discrete Applied Mathematics, 2023
Wensheng Sun, Yujun Yang
semanticscholar   +1 more source

Geodesic transversal problem for join and lexicographic product of graphs

Computational and Applied Mathematics, 2022
Iztok Peterin, G. Semanišin
semanticscholar   +1 more source

Path-connectivity of lexicographic product graphs

International Journal of Computer Mathematics, 2014
Dirac showed that in a -connected graph there is a path through all the k vertices. The k-path-connectivity of a graph G, which is a generalization of Dirac's notion, was introduced by Hager in 1986. Denote by the lexicographic product of two graphs G and H. In this paper, we prove that for any two connected graphs G and H. Moreover, the
openaire   +1 more source

On connected co-independent domination in the join, corona and lexicographic product of graphs

Discret. Math. Algorithms Appl., 2022
Reyna Mae L. Detalla, Marlou T. Perocho, Helen M. Rara, S. Canoy   +3 more
semanticscholar   +1 more source

On the resistance diameter of the Cartesian and lexicographic product of paths

Journal of Applied Mathematics and Computation, 2021
Yun-Xiang Li, Si-Ao Xu, Hongbo Hua, Xiangfeng Pan   +3 more
semanticscholar   +1 more source

The doubly resolving number of the lexicographic product of graphs

Discrete Mathematics, Algorithms and Applications (DMAA)
Mohsen Jannesari
semanticscholar   +1 more source

Antisymmetry and Lexicographic Product Relations

Mathematical Logic Quarterly, 1981
openaire   +2 more sources

Fair Restrained Dominating Set in the Cartesian Product and Lexicographic Product of Graphs

, 2021
Debie Honey P. Galleros, Enrico L. Enriquez   +1 more
semanticscholar   +1 more source