Results 91 to 100 of about 9,811 (181)
Edge properties of lexicographic product graphs of open neighborhood graphs
The Scientific TemperThis research investigates the complex edge characteristics of lexicographic product graphs formed from open neighborhood graphs, filling a notable gap in understanding their structural and adjacency features. Such graphs are pivotal in combinatorial optimization, network architecture, and computational graph theory, particularly for analyzing large ...
Rudrapati Bhuvaneswara Prasad +1 more
openaire +1 more source
Karpatsʹkì Matematičnì Publìkacìï, 2019 For a (molecular) graph, the Wiener index, hyper-Wiener index and degree distance index are defined as $$W(G)= \sum_{\{u,v\}\subseteq V(G)}d_G(u,v),$$ $$WW(G)=W(G)+\sum_{\{u,v\}\subseteq V(G)} d_{G}(u,v)^2,$$ and $$DD(G)=\sum_{\{u,v\}\subseteq V(G)}d_G(u,
N. Dehgardi +2 more
doaj +1 more source
The Metric Dimension of Lexicographic Product of Graphs
, 2011 11 ...
Jannesari, Mohsen, Omoomi, Behnaz
openaire +2 more sources
On alpha labeling of tensor product of paths and cycles. [PDF]
Heliyon, 2023 L U, G R.
europepmc +1 more source
Skew-spectra and skew energy of various products of graphs [PDF]
Transactions on Combinatorics, 2015 Given a graph $G$, let $G^sigma$ be an oriented graph of $G$ with the orientation $sigma$ and skew-adjacency matrix $S(G^sigma)$. Then the spectrum of $S(G^sigma)$ consisting of all the eigenvalues of $S(G^sigma)$ is called the skew-spectrum of $G ...
Xueliang Li, Huishu Lian
doaj
A Note on the Thue Chromatic Number of Lexicographic Products of Graphs
Discussiones Mathematicae Graph Theory, 2018 A sequence is called non-repetitive if none of its subsequences forms a repetition (a sequence r1r2⋯r2n such that ri = rn+i for all 1 ≤ i ≤ n). Let G be a graph whose vertices are coloured.
Peterin Iztok +3 more
doaj +1 more source
On Zagreb coindices and Mostar index of [Formula: see text] nanotubes. [PDF]
Sci Rep, 2023 Imran M +4 more
europepmc +1 more source
Edge-coloring of generalized lexicographic product of graphs
AIMS Mathematics<abstract><p>An edge-coloring of a graph $ G $ is an assignment of colors to its edges so that no two edges incident to the same vertex receive the same color. The chromatic index of $ G $, denoted by $ \chi'(G) $, is the least $ k $ for which $ G $ has a $ k $ edge-coloring.
Shuangliang Tian, Ping Chen
openaire +2 more sources
On the local antimagic chromatic number of the lexicographic product of graphs [PDF]
Discrete Mathematics Letters, 2023 Gee-Choon Lau +4 more
doaj +1 more source
The distance Seidel matrix of connected graphs
AKCE International Journal of Graphs and CombinatoricsFor a connected graph G, we present the concept of a new graph matrix related to its distance and Seidel matrix, called distance Seidel matrix [Formula: see text]. Suppose that the eigenvalues of [Formula: see text] be [Formula: see text] In this article,
T. Haritha, A. V. Chithra
doaj +1 more source