Results 1 to 10 of about 740,582 (289)
THE RAINBOW VERTEX-CONNECTION NUMBERS OF WHEEL-SHIELD GRAPHS
BarekengLet be a nontrivial simple connected graph, be an edge of and be an integer greater than or equal to . A path of order , denoted by , is a graph whose vertices can be labelled such that .
Ratnaning Palupi, A. N. M. Salman
doaj +1 more source
Hasil Kali Matriks (Mod 2) pada Graf Roda, Graf Pertemanan dan Graf Bunga
Jambura Journal of Mathematics, 2021 ABSTRAK Pada artikel ini dibahas sifat-sifat hasil kali matriks (mod 2) terkait graf roda, graf pertemanan, dan graf bunga yang grafikal. Beberapa hasil yang diperoleh, A(Wn)A(Wn)(Mod 2) dan A(Wn)A(Sn)(Mod 2) grafikal apabila n=2k+1 dengan Sn merupakan ...
Fransiskus Fran +2 more
doaj +1 more source
Modal Analysis of In-Wheel Motor-Driven Electric Vehicle Based on Bond Graph Theory
Shock and Vibration, 2017 A half-car vibration model of an electric vehicle driven by rear in-wheel motors was developed using bond graph theory and the modular modeling method. Based on the bond graph model, modal analysis was carried out to study the vibration characteristics ...
Di Tan, Qiang Wang, Yanshou Wu
doaj +1 more source
On Generalized Topological Indices for Some Special Graphs
Journal of Mathematics, 2022 Topological indices are numeric values associated with a graph and characterize its structure. There are various topological indices in graph theory such as degree-based, distance-based, and counting-related topological indices.
Sheeba Afridi +2 more
doaj +1 more source
The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs [PDF]
Journal of Graph Theory, 2018 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
openaire +4 more sources
Geometric Simultaneous Embeddings of a Graph and a Matching
Journal of Graph Algorithms and Applications, 2011 The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is plane.
Sergio Cabello +5 more
doaj +1 more source
Planar and non-planar wheel-related networks possess edge -graceful labeling
Mathematics OpenFor an integer [Formula: see text], consider a collection of numbers [Formula: see text] and a network [Formula: see text] with [Formula: see text] and [Formula: see text].
Mohamed R. Zeen El Deen +3 more
doaj +1 more source
The coalescence of multi-wheel and starlike graphs is DLS [PDF]
Journal of Mahani Mathematical ResearchThe Laplacian spectrum of a graph is obtained by taking the difference of the adjacency spectrum from the diagonal matrix of degrees. If a graph has a unique Laplacian spectrum, it means that it can be identified by this spectrum, it is called $DLS ...
Mohammad Hasan Ahangarani Farahani +1 more
doaj +1 more source
Complexity of Join and Corona graphs and Chebyshev polynomials
Journal of Taibah University for Science, 2018 Boesh and Prodinger have shown how to use properties of Chebyshev polynomials to compute formulas for the number of spanning trees of some special graphs.
S. N. Daoud
doaj +1 more source
On dynamic colouring of cartesian product of complete graph with some graphs
Journal of Taibah University for Science, 2020 A proper vertex colouring is called a 2-dynamic colouring, if for every vertex v with degree at least 2, the neighbours of v receive at least two colours. The smallest integer k such that G has a dynamic colouring with k colours denoted by $\chi _2(G) $.
K. Kaliraj +2 more
doaj +1 more source