Results 21 to 30 of about 5,134,655 (243)

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, Saira Javed, Yasmene F. Alanazi, Abdulaziz Mohammed Alanazi   +3 more
doaj   +2 more sources

Another H-super magic decompositions of the lexicographic product of graphs

Indonesian Journal of Combinatorics, 2018
Let H and G be two simple graphs. The concept of an H-magic decomposition of G arises from the combination between graph decomposition and graph labeling. A decomposition of a graph G into isomorphic copies of a graph H is H-magic if there is a bijection
H Hendy, Kiki A. Sugeng, A.N.M Salman, Nisa Ayunda   +3 more
doaj   +2 more sources

Super connectivity of lexicographic product graphs [PDF]

, 2020
For a graph $G$, $k(G)$ denotes its connectivity. A graph is super connected if every minimum vertex-cut isolates a vertex. Also $k_{1}$-connectivity of a connected graph is the minimum number of vertices whose deletion gives a disconnected graph without isolated vertices.
Khalid Kamyab, Mohsen Ghasemi, Rezvan Varmazyar   +2 more
openalex   +3 more sources

On star and acyclic coloring of generalized lexicographic product of graphs

AIMS Mathematics, 2022
A $ star \; coloring $ of a graph $ G $ is a proper vertex coloring of $ G $ such that any path of length 3 in $ G $ is not bicolored. The $ star \; chromatic \; number $ $ \chi_s(G) $ of $ G $ is the smallest integer $ k $ for which $ G $ admits a star ...
Jin Cai, Shuangliang Tian, Lizhen Peng
doaj   +2 more sources

Hamiltonian properties in generalized lexicographic products [PDF]

Discussiones Mathematicae Graph Theory, 2023
19 pages, 2 ...
Jan Ekstein, Jakub Teska
openalex   +4 more sources

Non-1-Planarity of Lexicographic Products of Graphs

Discussiones Mathematicae Graph Theory, 2021
In this paper, we show the non-1-planarity of the lexicographic product of a theta graph and K2. This result completes the proof of the conjecture that a graph G ◦ K2 is 1-planar if and only if G has no edge belonging to two cycles.
Matsumoto Naoki, Suzuki Yusuke
doaj   +2 more sources

Double domination in lexicographic product graphs [PDF]

Discrete Applied Mathematics, 2020
In a graph $G$, a vertex dominates itself and its neighbours. A subset $S\subseteq V(G)$ is said to be a double dominating set of $G$ if $S$ dominates every vertex of $G$ at least twice. The minimum cardinality among all double dominating sets of $G$ is the double domination number.
Abel Cabrera Martínez, Suitberto Cabrera García, J. A. Rodríguez-Velázquez   +2 more
semanticscholar   +8 more sources

Gromov hyperbolicity in lexicographic product graphs [PDF]

Proceedings - Mathematical Sciences, 2018
arXiv admin note: text overlap with arXiv:1410 ...
Walter Carballosa, Amauris de la Cruz, José M. Rodrı́guez   +2 more
openalex   +5 more sources

The equidistant dimension of graphs: NP-completeness and the case of lexicographic product graphs

AIMS Mathematics
Let $ V(G) $ be the vertex set of a simple and connected graph $ G $. A subset $ S\subseteq V(G) $ is a distance-equalizer set of $ G $ if, for every pair of vertices $ u, v\in V(G)\setminus S $, there exists a vertex in $ S $ that is equidistant to $ u $
Adrià Gispert-Fernández , Juan Alberto Rodríguez-Velázquez   +1 more
doaj   +2 more sources

On lexicographic products [PDF]

Colloquium Mathematicum, 1974
A. J. Ostaszewski
openalex   +2 more sources