Results 11 to 20 of about 855,414 (324)
Embeddability of joins and products of polyhedra [PDF]
Topological Methods in Nonlinear Analysis, 2022 Sergey A. Melikhov
openalex +3 more sources
Eccentricity based graph parameters of subdivision-vertex-vertex (edge-edge) join products
Ain Shams Engineering JournalEffective utilization of graph products are essential for the development of complex networking systems. The graph product can produce a diverse array of fundamental graphs as an application.
Anam Shahzad +4 more
doaj +2 more sources
Every graph is local antimagic total and its applications [PDF]
Opuscula Mathematica, 2023 Let \(G = (V,E)\) be a simple graph of order \(p\) and size \(q\). A graph \(G\) is called local antimagic (total) if \(G\) admits a local antimagic (total) labeling. A bijection \(g : E \to \{1,2,\ldots,q\}\) is called a local antimagic labeling of \(G\)
Gee-Choon Lau +2 more
doaj +1 more source
On the crossing numbers of join products of five graphs of order six with the discrete graph [PDF]
Opuscula Mathematica, 2020 The main purpose of this article is broaden known results concerning crossing numbers for join of graphs of order six. We give the crossing number of the join product \(G^{\ast} + D_n\), where the disconnected graph \(G^{\ast}\) of order six consists of ...
Michal Staš
doaj +1 more source
Crossing Numbers of Join Product with Discrete Graphs: A Study on 6-Vertex Graphs
Mathematics, 2023 Reducing the number of crossings on graph edges can be useful in various applications, including network visualization, circuit design, graph theory, cartography or social choice theory.
Jana Fortes, Michal Staš
doaj +1 more source
On the crossing numbers of join products of W_{4}+P_{n} and W_{4}+C_{n} [PDF]
Opuscula Mathematica, 2021 The crossing number \(\mathrm{cr}(G)\) of a graph \(G\) is the minimum number of edge crossings over all drawings of \(G\) in the plane. The main aim of the paper is to give the crossing number of the join product \(W_4+P_n\) and \(W_4+C_n\) for the ...
Michal Staš, Juraj Valiska
doaj +1 more source
The Crossing Number of Cartesian Product of 5-Wheel with any Tree
Discussiones Mathematicae Graph Theory, 2021 In this paper, we establish the crossing number of join product of 5-wheel with n isolated vertices. In addition, the exact values for the crossing numbers of Cartesian products of the wheels of order at most five with any tree T are given.
Wang Yuxi, Huang Yuanqiu
doaj +1 more source
ALTERNATIVE PROOF ON THE CROSSING NUMBER OF K1,1,3,N [PDF]
Acta Electrotechnica et Informatica, 2019 The main aim of the paper is to give the crossing number of join product G+Dn for the connected graph G of order five isomorphic with the complete tripartite graph K1,1,3, where Dn consists on n isolated vertices.
Michal STAS
doaj +1 more source
Reduced join and Whitehead product [PDF]
Reduced join and Whitehead productHirosi,Toda
openaire +2 more sources
The majority coloring of the join and Cartesian product of some digraph [PDF]
MATEC Web of Conferences, 2022 A majority coloring of a digraph is a vertex coloring such that for every vertex, the number of vertices with the same color in the out-neighborhood does not exceed half of its out-degree.
Shi Mei +3 more
doaj +1 more source