Results 201 to 210 of about 5,793,190 (230)
Some of the next articles are maybe not open access.
From (Secure) w-Domination in Graphs to Protection of Lexicographic Product Graphs
Bulletin of the Malaysian Mathematical Sciences Society, 2021Let 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 +2 more
semanticscholar +1 more source
Convex Sets in Lexicographic Products of Graphs
Graphs and Combinatorics, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bijo S. Anand +3 more
openaire +1 more source
Lexicographic Products and a Conjecture of Hahn and Jackson
SIAM Journal on Discrete Mathematics, 2009Summary: The Gallai-Milgram theorem asserts that the vertex set of any digraph with stability number \(k\) can be partitioned into \(k\) directed paths. Hahn and Jackson conjectured that, for any positive integer \(k\), there exists a digraph with stability number \(k\) such that the subdigraph obtained by deleting any \(k-1\) directed paths still has ...
J. Adrian Bondy +2 more
openaire +2 more sources
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 +3 more
semanticscholar +1 more source
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 +3 more
semanticscholar +1 more source
Bounds of Some Degree Based Indices of Lexicographic Product of Some Connected Graphs
Polycyclic aromatic compounds (Print), 2020There 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. Siddiqui +3 more
semanticscholar +1 more source
A Note on Hamiltonian Cycles in Lexicographical Products
J. Autom. Lang. Comb., 1997A typical sufficient condition for the existence of a hamiltonian cycle in a lexicographical product $G[H]$ of two graphs $G$ and $H$ forces $G$ to contain a hamiltonian cycle or $G$ to contain a hamiltonian path and $H$ to have some additional properties.
openaire +2 more sources
Solution to a conjecture on resistance diameter of lexicographic product of paths
Discrete Applied Mathematics, 2023Wensheng Sun, Yujun Yang
semanticscholar +1 more source
Geodesic transversal problem for join and lexicographic product of graphs
Computational and Applied Mathematics, 2022Iztok Peterin, G. Semanišin
semanticscholar +1 more source
On forwarding indices of lexicographic product networks
Concurrency and Computation: Practice and Experience, 2019SummaryOne of the important functions of a communication network is the routing. The communication and performance of a network whose efficiency can be directly affected by edge‐forwarding index of the routing and the edge‐forwarding index can be used to deterministically measure its efficiency.
openaire +1 more source
On connected co-independent domination in the join, corona and lexicographic product of graphs
Discret. Math. Algorithms Appl., 2022Reyna Mae L. Detalla +3 more
semanticscholar +1 more source