Results 31 to 40 of about 1,343 (197)
Radio Labelings of Lexicographic Product of Some Graphs
Journal of Mathematics, 2021 Labeling of graphs has defined many variations in the literature, e.g., graceful, harmonious, and radio labeling. Secrecy of data in data sciences and in information technology is very necessary as well as the accuracy of data transmission and different ...
Muhammad Shahbaz Aasi +3 more
doaj +1 more source
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.
Cláudia Linhares Sales +2 more
openaire +2 more sources
A Lexicographic Product Cancellation Property for Digraphs [PDF]
, 2012 There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographic. Of these four product graphs, the lexicographic product graph is the least studied.
Manion, Kendall, Kendall Lee Manion
core +2 more sources
Automorphisms of lexicographic products
Discrete Mathematics, 1975 AbstractThe automorphism group Γ(P) of a partially ordered set P consists of all permutations on P that preserve order (and have order preserving inverses). In this paper we raise, and partially answer, the question: How is the automorphism group of the lexicographic product (P × Q) of two orders (P and Q) related to the automorphism groups of the ...
Elliot Bird +2 more
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
Total Coloring Conjecture for Certain Classes of Graphs
Algorithms, 2018 A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no two adjacent or incident elements receive the same color.
R. Vignesh, J. Geetha, K. Somasundaram
doaj +1 more source
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.
Min Feng, Min Xu, Kaishun Wang
openaire +3 more sources
Motion Planning in Certain Lexicographic Product Graphs [PDF]
, 2018 In this article, we give the minimum number of moves required for the motion planning problem in Lexicographic products of some graphs. In addition, we proved the necessary and sufficient condition for the connectivity of the lexicographic product of two
A. D Akwu (5758639) +1 more
core +1 more source
On the indices of certain graph products [PDF]
Transactions on CombinatoricsMolecular descriptors are numerical graph invariants that are used to study the chemical structure of molecules. In this paper, we determine the upper bound of the Sombor index based on four operations involving the subdivision graph, semi-total point ...
Ishita Sarkar, Manjunath Nanjappa
doaj +1 more source
The Sigma Coindex of Graph Operations
Journal of Mathematics, 2021 The sigma coindex is defined as the sum of the squares of the differences between the degrees of all nonadjacent vertex pairs. In this paper, we propose some mathematical properties of the sigma coindex.
Yasar Nacaroglu
doaj +1 more source