Results 1 to 10 of about 11,026 (283)
On Subtrees of Fan Graphs, Wheel Graphs, and “Partitions” of Wheel Graphs under Dynamic Evolution [PDF]
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
Prime labeling of graphs constructed from wheel graph. [PDF]
الملخص إن التسمية الرئيسية للرسم البياني البسيط غير الموجه G هي تعيين تسميات أعداد صحيحة فريدة من المجموعة {1،2،....،|V \( G\)|} لكل رأس بحيث يكون لأي رأسين متجاورين في الرسم البياني تسميات أولية نسبيًا. يمكن أن تساعدنا دراسة العلامات الرئيسية في الرسوم البيانية على فهم بنية وخصائص الرسوم البيانية والعلامات الرئيسية لها تطبيقات محتملة في التشفير وأمن ...
Abughazaleh B, Abughneim OA.
europepmc +4 more sources
Modeling and Simulation of the Vibration Characteristics of the In-Wheel Motor Driving Vehicle Based on Bond Graph [PDF]
Bond graph theory is applied to the modeling and analysis of the vibration characteristics of the in-wheel motor driving vehicle. First, an 11-degree-of-freedom vibration model of the in-wheel motor driving vehicle is established based on bond graph, and
Di Tan, Qiang Wang
doaj +2 more sources
<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
openalex +3 more sources
Wheel-free planar graphs [PDF]
A \emph{wheel} is a graph formed by a chordless cycle $C$ and a vertex $u$ not in $C$ that has at least three neighbors in $C$. We prove that every 3-connected planar graph that does not contain a wheel as an induced subgraph is either a line graph or has a clique cutset.
Pierre Aboulker +3 more
openalex +3 more sources
Wheel Random Apollonian Graphs [PDF]
In this paper a subset of High-Dimensional Random Apollonian networks, that we called Wheel Random Apollonian Graphs (WRAG), is considered. We show how to generate a Wheel Random Apollonian Graph from a wheel graph. We analyse some basic graph properties like vertices and edges cardinality, some question concerning cycles and the chromaticity in such ...
Piero Giacomelli
openalex +3 more sources
The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs [PDF]
AbstractIn this paper, we study the class of graphs defined by excluding the following structures as induced subgraphs: theta, pyramid, 1‐wheel, and 3‐wheel. We describe the structure of graphs in , and we give a polynomial‐time recognition algorithm for this class. We also prove that ‐free graphs in are 4‐colorable.
Valerio Boncompagni +2 more
openalex +4 more sources
Incidence and Laplacian matrices of wheel graphs and their inverses
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 +3 more sources
Super (a, d)-Edge Antimagic Total Labeling of Connected Ferris Wheel Graph
Let G be a simple graph of order p and size q. Graph G is called an (a,d)-edge-antimagic totalifthereexistabijectionf :V(G)∪E(G)→{1,2,...,p+q}suchthattheedge-weights,w(uv)= f(u)+f(v)+f(uv); u, v ∈ V (G), uv ∈ E(G), form an arithmetic sequence with first ...
Djoni Budi Sumarno +2 more
doaj +3 more sources
Certain Energies of Graphs for Dutch Windmill and Double-Wheel Graphs [PDF]
Energy of a graph is defined as the sum of the absolute values of the eigenvalues of the adjacency matrix associated with the graph. In this research work, we find color energy, distance energy, Laplacian energy, and Seidel energy for the Dutch windmill ...
Jing Wu +3 more
doaj +2 more sources

