Results 11 to 20 of about 9,811 (181)
Some diameter notions in lexicographic product [PDF]
Electronic Journal of Graph Theory and Applications, 2018 Many graphs such as hypercubes, star graphs, pancake graphs, grid, torus etc are known to be good interconnection network topologies. In any network topology, the vertices represent the processors and the edges represent links between the processors. Two
Chithra MR +2 more
doaj +2 more sources
Domination polynomial of lexicographic product of specific graphs [PDF]
Journal of Information and Optimization Sciences, 2018 Let $G$ be a simple graph of order $n$. The domination polynomial of $G$ is the polynomial $D(G, )=\sum_{i=0}^{n} d(G,i) ^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. We consider the lexicographic product of two specific graphs and study their domination polynomials.
Alikhani, Saeid, Jahari, Somayeh
openaire +4 more sources
The Local Metric Dimension of the Lexicographic Product of Graphs [PDF]
Bulletin of the Malaysian Mathematical Sciences Society, 2018 The metric dimension is quite a well-studied graph parameter. Recently, the adjacency dimension and the local metric dimension have been introduced and studied. In this paper, we give a general formula for the local metric dimension of the lexicographic product $G \circ \mathcal{H}$ of a connected graph $G$ of order $n$ and a family $\mathcal{H ...
Barragán-Ramírez, Gabriel A. +3 more
openaire +5 more sources
On the Roman domination in the lexicographic product of graphs
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kraner Šumenjak, Tadeja +2 more
openaire +6 more sources
Geodetic numbers of tensor product and lexicographic product of graphs
AKCE International Journal of Graphs and CombinatoricsA shortest [Formula: see text]-[Formula: see text] path between two vertices u and v of a graph G is a [Formula: see text]-[Formula: see text] geodesic of G.
K. Raja Chandrasekar
doaj +2 more sources
Rainbow domination in the lexicographic product of graphs
Discrete Applied Mathematics, 2013 14 pages, 2 ...
Kraner Šumenjak, Tadeja +2 more
openaire +5 more sources
Operations on Neutrosophic Vague Soft Graphs [PDF]
Neutrosophic Sets and Systems, 2022 This article concerns with the neutrosophic vague soft graphs for treating neutrosophic vague soft information by employing the theory of neutrosophic vague soft sets with graphs.
S. Satham Hussain +3 more
doaj +1 more source
The Spectrum of Weighted Lexicographic Product on Self-Complementary Graphs
IEEE Access, 2023 The lexicographic product, a powerful binary operation in graph theory, offers methods for creating a novel graph by establishing connections between each vertex of one graph and every vertex of another.
Xiaoxiao Zhang, Zenghui Fang
doaj +1 more source
Operations on Neutrosophic Vague Graphs [PDF]
Neutrosophic Sets and Systems, 2020 Neutrosophic graph is a mathematical tool to hold with imprecise and unspecified data. In this manuscript, the operations on neutrosophic vague graphs are introduced. Moreover, Cartesian product, lexicographic product, cross product, strong product and
S. Satham Hussain +3 more
doaj +1 more source
Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs.
Didem Gözüpek +2 more
doaj +1 more source