Results 11 to 20 of about 11,026 (283)
Tr-Span of Directed Wheel Graphs
Discussiones Mathematicae Graph Theory, 2018 In this paper, we consider T-colorings of directed graphs. In particular, we consider as a T-set the set Tr = {0, 1, 2, . . ., r−1, r+1, . . .}. Exact values and bounds of the Tr-span of directed graphs whose underlying graph is a wheel graph are ...
Besson Marc, Tesman Barry
doaj +2 more sources
Graphs with no 7-wheel subdivision [PDF]
Discrete Mathematics, 2014 The subgraph homeomorphism problem, SHP($H$), has been shown to be polynomial-time solvable for any fixed pattern graph $H$, but practical algorithms have been developed only for a few specific pattern graphs. Among these are the wheels with four, five, and six spokes.
Rebecca Robinson, Graham Farr
openalex +3 more sources
Wheels in planar graphs and Hajós graphs [PDF]
Journal of Graph Theory, 2021 AbstractIt was conjectured by Hajós that graphs containing no ‐subdivision are 4‐colorable. Previous results show that any possible minimum counterexample to Hajós' conjecture, called Hajós graph, is 4‐connected but not 5‐connected. In this paper, we show that if a Hajós graph admits a 4‐cut or 5‐cut with a planar side then the planar side must be ...
Qiqin Xie +3 more
openaire +2 more sources
Arithmetical Structures on Wheel Graphs [PDF]
An arithmetical structure on a finite and connected graph G is a pair (d, r) of positive integer vectors such that r is primitive (the gcd of its entries is 1) and (diag(d) - A)r = 0, where A is the adjacency matrix of G. In this article, we investigate arithmetical structures on the wheel graphs.
Bibhas Adhikari +3 more
openalex +3 more sources
Complexity of Some Duplicating Networks
IEEE Access, 2021 There are plentiful ways to duplicate a graph (network), such as splitting, shadow, mirror, and total graph. In this paper, we derive an evident formula of the complexity, a number of spanning trees, of the closed helm graph, the mirror graph of the path
Mohamed R. Zeen El Deen +1 more
doaj +1 more source
Restricted Detour Polynomial of a Straight Chain of Wheel Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2023 Restricted detour distance between two vertices and of a graph is the length of a longest u- v path for the induced condition (V (P))=P.
Herish Abdullah, Ivan Ali
doaj +1 more source
The even vertex magic total labelings of t-fold wheels
AIMS Mathematics, 2023 Let $ G $ be a graph of order $ n $ and size $ m $. A vertex magic total labeling of $ G $ is a one-to-one function $ f $: $ V(G) \cup E(G) \rightarrow \{1, 2, \cdots, n+m\} $ with the property that for each vertex $ u $ of $ G $, the sum of the label of
Supaporn Saduakdee, Varanoot Khemmani
doaj +1 more source
Coloring of (P5, 4-wheel)-free graphs [PDF]
Discrete Mathematics, 2022 Revised compact version; Accepted for publication in Discrete ...
Arnab Char, T. Karthick
openaire +3 more sources
The Basis Number of symmetric Difference of K2 With Some Special Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2014 This research aims to account the basis number of symmetric difference of K2 with some special graphs such as a saw graph, a cog –graphs, a fan graph and a wheel graph.
Ghassan Marougi, Ahmed Ali, Rasha Hasan
doaj +1 more source
A note on the Ramsey numbers for theta graphs versus the wheel of order 5
AKCE International Journal of Graphs and Combinatorics, 2018 The study of exact values and bounds on the Ramsey numbers of graphs forms an important family of problems in the extremal graph theory. For a set of graphs S and a graph F , the Ramsey number R (S , F) is the smallest positive integer r such that for ...
Mohammed M.M. Jaradat +3 more
doaj +2 more sources