Results 21 to 30 of about 26,105 (190)

Graph Invariants of Deleted Lexicographic Product of Graphs [PDF]

Mathematics Interdisciplinary Research, 2019
‎The deleted lexicographic‎ ‎product G[H]-nG of graphs G and H is a graph with vertex set V(G)×V(H)‎ and u=(u1‎, ‎v1) is adjacent with v=(u2‎, ‎v2) whenever (u1=u2 and‎ v1 is adjacent with v2) or (v1 ≠ v2 and u1 is adjacent with u2)‎.
Bahare Akhavan Mahdavi, Mostafa Tavakoli, Freydoon Rahbarnia   +2 more
doaj   +1 more source

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, Muhammad Asif, Tanveer Iqbal, Muhammad Ibrahim   +3 more
doaj   +1 more source

Rees products and lexicographic shellability [PDF]

Journal of Combinatorics, 2012
31 pages; 1 figure; part of this paper was originally part of the longer paper arXiv:0805.2416v1, which has been split into three ...
Linusson, Svante, Shareshian, John, Wachs, Michelle L.   +2 more
openaire   +2 more sources

Game chromatic number of lexicographic product graphs

AKCE International Journal of Graphs and Combinatorics, 2015
In this paper, we determine the exact values of the game chromatic number of lexicographic product of path P2 with path Pn, star K1,n and wheel Wn. Also we give an upper bound for the game chromatic number of lexicographic product of any two simple ...
R. Alagammai, V. Vijayalakshmi
doaj   +1 more source

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

On the indices of certain graph products [PDF]

Transactions on Combinatorics
Molecular 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

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

Computing the Rank Profile Matrix [PDF]

, 2015
The row (resp. column) rank profile of a matrix describes the staircase shape of its row (resp. column) echelon form. In an ISSAC'13 paper, we proposed a recursive Gaussian elimination that can compute simultaneously the row and column rank profiles of a
Bourbaki N., Dongarra J. J., Grigor'ev D. Y., Malaschonok G. I., Storjohann A.   +4 more
core   +5 more sources