Results 11 to 20 of about 59,758 (255)
Betweenness centrality in Cartesian product of graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 Betweenness centrality is a widely used measure in various graphs and it has a pivotal role in the analysis of complex networks. It measures the potential or power of a node to control the communication over the network.
Sunil Kumar R., Kannan Balakrishnan
doaj +4 more sources
Cartesian product of hypergraphs: properties and algorithms [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product.
Alain Bretto +2 more
doaj +6 more sources
The generalized 3-connectivity of Cartesian product graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graph ...
Hengzhe Li, Xueliang Li, Yuefang Sun
doaj +5 more sources
Hadwiger Number and the Cartesian Product of Graphs [PDF]
Graphs and Combinatorics, 2008 The Hadwiger number mr(G) of a graph G is the largest integer n for which the complete graph K_n on n vertices is a minor of G. Hadwiger conjectured that for every graph G, mr(G) >= chi(G), where chi(G) is the chromatic number of G. In this paper, we study the Hadwiger number of the Cartesian product G [] H of graphs.
Chandran, L Sunil +2 more
openaire +4 more sources
The Cartesian product of graphs with loops [PDF]
Ars Mathematica Contemporanea, 2015 We extend the definition of the Cartesian product to graphs with loops and show that the Sabidussi-Vizing unique factorization theorem for connected finite simple graphs still holds in this context for all connected finite graphs with at least one unlooped vertex. We also prove that this factorization can be computed in O(m) time, where m is the number
Boiko, Tetiana +4 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
DP‐coloring Cartesian products of graphs
Journal of Graph Theory, 2022 AbstractDP‐coloring (also called correspondence coloring) is a generalization of list coloring introduced by Dvořák and Postle in 2015. Motivated by results related to list coloring Cartesian products of graphs, we initiate the study of the DP‐chromatic number, , of the same. We show that , where is the coloring number of the graph .
Hemanshu Kaul +3 more
openaire +3 more sources
Peg Solitaire on Cartesian Products of Graphs [PDF]
Graphs and Combinatorics, 2021 AbstractIn 2011, Beeler and Hoilman generalized the game of peg solitaire to arbitrary connected graphs. In the same article, the authors proved some results on the solvability of Cartesian products, given solvable or distance 2-solvable graphs. We extend these results to Cartesian products of certain unsolvable graphs.
Kreh, Martin, Wiljes, Jan-Hendrik de
openaire +2 more sources
On the power domination number of the Cartesian product of graphs
AKCE International Journal of Graphs and Combinatorics, 2019 We give a brief survey about the existing results on the power domination of the Cartesian product of graphs, and improve two of the results by determining the exact power domination numbers of two families of graphs, namely, the cylinder Pn□Cmand the ...
K.M. Koh, K.W. Soh
doaj +2 more sources
Nonseparating Independent Sets of Cartesian Product Graphs [PDF]
Taiwanese Journal of Mathematics, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cao, Fayun, Ren, Han
openaire +3 more sources