Results 221 to 230 of about 5,134,655 (243)

On the Pancyclicity of Lexicographic Products

Graphs and Combinatorics, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kaiser, Tomáš, Kriesell, Matthias
openaire   +2 more sources

The weight of lexicographic products

Topology and its Applications, 2020
Let \(\gamma\) be an ordinal \(\geq 2\) and \(X_\alpha\) be a GO-space for ...
Hirata, Yasushi, Kemoto, Nobuyuki
openaire   +2 more sources

Doubly Isolate Domination in Lexicographic Product of Graphs

International Journal of Mathematical and Computer Sciences
For given positive integers a, b, and c such that 2\leq a\leq b\leq c, we show that there exists a connected graph G such that \gamma(G)=a, \gamma_0(G)=b, and \gamma_{00}(G)=c where \gamma is a domination number and \gamma_0 is an isolate domination ...
Ronel Baluntang
semanticscholar   +1 more source

Diagnosability of the Lexicographic Product of Paths and Paths under PMC Model

2024 IEEE International Conference on Advanced Information, Mechanical Engineering, Robotics and Automation (AIMERA)
In a multiprocessor system, if the number of faulty processors is less than t, and the system can identify all faulty processors directly without any exchanging, then the system’s diagnosability is t.
Bu Chen, Feng Li
semanticscholar   +1 more source

From (Secure) w-Domination in Graphs to Protection of Lexicographic Product Graphs

Bulletin of the Malaysian Mathematical Sciences Society, 2021
Let w=(w0,w1,⋯,wl)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$w=(w_0,
A. Cabrera Martínez, A. Estrada-Moreno, J. A. Rodríguez-Velázquez   +2 more
semanticscholar   +1 more source

Diagnosability of the lexicographic product of cycles and paths under PMC Model

International Congress on Information and Communication Technology
By increasing the number of processors and with the help of the large-scale interconnection networks built on processors, the advanced multiprocessor systems, obtain their superpower of computing.
Bu Chen, Feng Li
semanticscholar   +1 more source

Cayley digraphs and lexicographic product

Frontiers of Mathematics in China, 2007
Let \(X\) and \(Y\) be digraphs. By the lexicographic product \(X[Y]\), we mean the digraph whose vertex set \(V(X[Y])\) is \(V(X)\times V(Y)\) and whose arc set is \[ A(X[Y]) = \left\{((x,y),(x',y'))\mid (x,x')\in A(X), \text{ or }x=x' \text{ and } (y,y')\in A(Y)\right\}.
Peng, Xing, Wang, Dianjun
openaire   +1 more source

Bounds of Some Degree Based Indices of Lexicographic Product of Some Connected Graphs

Polycyclic aromatic compounds (Print), 2020
There are different mathematical tools to establish a numeric correlation between a chemical structure and its properties. A topological index is such a successful tool. It represents a graph in form of a single real number.
H. M. A. Siddiqui, Shakila Baby, M. Nadeem, M. Shafiq   +3 more
semanticscholar   +1 more source

Lexicographic Minimum Solution to the System of Fuzzy Relation Inequalities With Addition-Min-Product Composition

IEEE transactions on fuzzy systems
The addition-min-product fuzzy relation inequalities were recently introduced to model peer-to-peer file-sharing systems, considering scenarios where the terminals transmit their local file data at varying quality levels.
Q. Shu, Guocheng Zhu, Xingming Wang, Xiaopeng Yang   +3 more
semanticscholar   +1 more source

Convex Sets in Lexicographic Products of Graphs

Graphs and Combinatorics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anand, Bijo S., Changat, Manoj, Klavžar, Sandi, Peterin, Iztok   +3 more
openaire   +1 more source