Results 11 to 20 of about 101,128 (285)
Super Connected Direct Product of Graphs and Cycles [PDF]
Axioms, 2022 The topology of an interconnection network can be modeled by a graph G=(V(G),E(G)). The connectivity of graph G is a parameter used to measure the reliability of a corresponding network. The direct product is an important graph product. This paper mainly
Jiaqiong Yin, Yingzhi Tian
doaj +6 more sources
Distance regularity in direct-product graphs [PDF]
Applied Mathematics Letters, 2000 Let \(G=(V,E)\) and \(H=(W,F)\) be graphs. The direct product \(G\times H\) of \(G\) and \(H\) is defined as follows: \(V(G\times H)=V\times W\) and \(E(G\times H)=\{\{(u,x),(v,y)\}:\{u,v\}\in E, \{x,y\}\in F\}\). In this paper the following results are obtained. If \(G\) and \(H\) are distance regular graphs of diameter at least two, then \(G\times H\)
Aggarwal, S., Jha, P. K., Vikram, M.
exaly +4 more sources
Hyperbolicity of Direct Products of Graphs [PDF]
Symmetry, 2018 It is well-known that the different products of graphs are some of the more symmetric classes of graphs. Since we are interested in hyperbolicity, it is interesting to study this property in products of graphs. Some previous works characterize the hyperbolicity of several types of product graphs (Cartesian, strong, join, corona and lexicographic ...
Alvaro Martinez Perez +2 more
exaly +7 more sources
On direct product cancellation of graphs [PDF]
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard H Hammack
exaly +3 more sources
On 3-Colorings of Direct Products of Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2019 The k-independence number of a graph G, denoted as αk(G), is the order of a largest induced k-colorable subgraph of G. In [S. Špacapan, The k-independence number of direct products of graphs, European J. Combin.
Špacapan Simon
doaj +4 more sources
A Heuristic for Direct Product Graph Decomposition [PDF]
Journal of Graph Algorithms and Applications, 2023 In this paper we describe a heuristic for decomposing a directed graph into factors according to the direct product (also known as Kronecker, cardinal or tensor product). Given a directed, unweighted graph $G$ with adjacency matrix $\mathbf{Adj}(G)$, our
Luca Calderoni +2 more
doaj +7 more sources
A quasicancellation property for the direct product of graphs [PDF]
Discrete Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Richard H Hammack
exaly +4 more sources
Unexpected automorphisms in direct product graphs [PDF]
Journal of Combinatorial Theory Series BzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Binzhou Xia
exaly +3 more sources
Various Product on Multi Fuzzy Graphs [PDF]
Ratio Mathematica, 2022 In this paper, the definition of complement of multi fuzzy graph, direct sum of two multi fuzzy graphs are given and derived some theorems related to them.
R Muthuraj, K Krithika, S Revathi
doaj +3 more sources
On edge product cordial graphs [PDF]
Opuscula Mathematica, 2019 An edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we characterize graphs admitting an edge product cordial labeling.
Jaroslav Ivančo
doaj +3 more sources