Results 21 to 30 of about 9,811 (181)
Identifying Codes of Lexicographic Product of Graphs [PDF]
The Electronic Journal of Combinatorics, 2012 Let $G$ be a connected graph and $H$ be an arbitrary graph. In this paper, we study the identifying codes of the lexicographic product $G[H]$ of $G$ and $H$. We first introduce two parameters of $H$, which are closely related to identifying codes of $H$. Then we provide the sufficient and necessary condition for $G[H]$ to be identifiable.
Feng, Min, Xu, Min, Wang, Kaishun
openaire +3 more sources
Non 1-planarity of lexicographic products of graphs
Discussiones Mathematicae Graph Theory, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matsumoto Naoki, Suzuki Yusuke
openaire +2 more sources
On the first and second Zagreb indices of some products of signed graphs
AKCE International Journal of Graphs and Combinatorics, 2023 Some of the most comprehensively studied degree-based topological indices are the Zagreb indices. In this article, the pair of Zagreb indices have been determined for five product graphs namely tensor product, Cartesian product, lexicographic product ...
Shivani Rai, Biswajit Deb
doaj +1 more source
Theory and Applications of Fermatean Neutrosophic Graphs [PDF]
Neutrosophic Sets and Systems, 2022 Yager et. al. defined a q-rung orthopair fuzzy sets as a new general class of Pythagorean fuzzy set in which the sum of the qth power of the support for and support against is bonded by one. Tapan et. al. extended the concept of intuitionistic fuzzy sets
Said Broumi +4 more
doaj +1 more source
From (Secure) w-Domination in Graphs to Protection of Lexicographic Product Graphs [PDF]
Bulletin of the Malaysian Mathematical Sciences Society, 2021 Let $w=(w_0,w_1, \dots,w_l)$ be a vector of nonnegative integers such that $ w_0\ge 1$. Let $G$ be a graph and $N(v)$ the open neighbourhood of $v\in V(G)$. We say that a function $f: V(G)\longrightarrow \{0,1,\dots ,l\}$ is a $w$-dominating function if $f(N(v))=\sum_{u\in N(v)}f(u)\ge w_i$ for every vertex $v$ with $f(v)=i$.
A. Cabrera Martínez +2 more
openaire +5 more sources
On the b-Continuity of the Lexicographic Product of Graphs [PDF]
Graphs and Combinatorics, 2017 A b-coloring of the vertices of a graph is a proper coloring where each color class contains a vertex which is adjacent to each other color class. The b-chromatic number of $G$ is the maximum integer $ _b(G)$ for which $G$ has a b-coloring with $ _b(G)$ colors. A graph $G$ is b-continuous if $G$ has a b-coloring with $k$ colors, for every integer $k$
Cláudia Linhares Sales +2 more
openaire +5 more sources
Comparative Study of Generalized Sum Graphs via Degree-Based Topological Indices
Journal of Mathematics, 2022 In theoretical chemistry, topological indices (TIs) have important role to predict various physical and structural properties of the study under molecular graphs.
Muhammad Javaid +2 more
doaj +1 more source
Broadcast domination of lexicographic and modular products of graphs
AKCE International Journal of Graphs and Combinatorics, 2022 A dominating broadcast labeling of a graph G is a function [Formula: see text] such that [Formula: see text] for all [Formula: see text] where e(v) is the eccentricity of v, and for every vertex [Formula: see text] there exists a vertex v with [Formula ...
Jishnu Sen, Srinivasa Rao Kola
doaj +1 more source
Computing Correlation among the Graphs under Lexicographic Product via Zagreb Indices
Journal of Chemistry, 2021 A topological index (TI) is a numerical descriptor of a molecule structure or graph that predicts its different physical, biological, and chemical properties in a theoretical way avoiding the difficult and costly procedures of chemical labs.
Muhammad Javaid +3 more
doaj +1 more source
First-Fit coloring of Cartesian product graphs and its defining sets [PDF]
, 2016 Let the vertices of a Cartesian product graph $G\Box H$ be ordered by an ordering $\sigma$. By the First-Fit coloring of $(G\Box H, \sigma)$ we mean the vertex coloring procedure which scans the vertices according to the ordering $\sigma$ and for each ...
Zaker, Manouchehr
core +3 more sources