Results 1 to 10 of about 11,128 (261)
Prime labeling of graphs constructed from wheel graph [PDF]
HeliyonA prime labeling of a simple undirected graph G is to assign unique integer labels from the set {1,2,...,|V(G)|} to each vertex such that any two adjacent vertices in the graph have labels that are relatively prime.
Baha' Abughazaleh, Omar A. Abughneim
doaj +4 more sources
On Subtrees of Fan Graphs, Wheel Graphs, and “Partitions” of Wheel Graphs under Dynamic Evolution [PDF]
Mathematics, 2019 The number of subtrees, or simply the subtree number, is one of the most studied counting-based graph invariants that has applications in many interdisciplinary fields such as phylogenetic reconstruction.
Yu Yang +4 more
doaj +2 more sources
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
Integrated model control of brake–wheel system using bond graph method
Advances in Mechanical Engineering, 2018 Brake system is an important actuator of most active safety systems equipped on vehicles. It combines with the wheel to make vehicle decelerate and finally stop it.
Jian Zhao +3 more
doaj +2 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
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
Incidence and Laplacian matrices of wheel graphs and their inverses
The American Journal of Combinatorics, 2023 It has been an open problem to find the Moore-Penrose inverses of the incidence, Laplacian, and signless Laplacian matrices of families of graphs except trees and unicyclic graphs.
Jerad Ipsen, Sudipta Mallik
doaj +1 more source
On Laplacian Eigenvalues of Wheel Graphs
Symmetry, 2023 Consider G to be a simple graph with n vertices and m edges, and L(G) to be a Laplacian matrix with Laplacian eigenvalues of μ1,μ2,…,μn=zero. Write Sk(G)=∑i=1kμi as the sum of the k-largest Laplacian eigenvalues of G, where k∈{1,2,…,n}. The motivation of this study is to solve a conjecture in algebraic graph theory for a special type of graph called a ...
Manal Alotaibi +2 more
openaire +1 more source
Odd Wheels Are Not Odd-distance Graphs [PDF]
Discrete & Computational Geometry, 2020 AbstractAn odd wheel graph is a graph formed by connecting a new vertex to all vertices of an odd cycle. We answer a question of Rosenfeld and Le by showing that odd wheels cannot be drawn in the plane so that the lengths of the edges are odd integers.
openaire +5 more sources
Journal of Mathematics and Mathematics Education, 2022 <p>A graph denoted by is a pair of where is a non-empty set of vertices in G, and E is a set of edges in G. In graph theory, there are various types of graphs including star graphs, cycle graph, and wheel graph. Graph operations on two or more types of graphs can produce new graphs. Amalgamation is one of the operations on graphs. Suppose and
Yemi Kuswardi +3 more
openaire +1 more source