Results 41 to 50 of about 740,582 (289)
A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
AKCE International Journal of Graphs and Combinatorics, 2023 The permanent of an n × n matrix [Formula: see text] is defined as [Formula: see text] where the sum is taken over all permutations σ of [Formula: see text] The permanental polynomial of M, denoted by [Formula: see text] is [Formula: see text] where In ...
Aqib Khan +2 more
doaj +1 more source
Graphs with no 7-wheel subdivision
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
openaire +4 more sources
, 2011 A graph that admits a Smarandachely super mean m-labeling is called a Smarandachely super m-mean graph, particularly, a mean graph if m = 2. In this paper, some new families of mean graphs are investigated.
Vaidya, S.K.
core +1 more source
Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs
Mathematics, 2018 In graph theory, a graph is given names—generally a whole number—to edges, vertices, or both in a chart. Formally, given a graph G = ( V , E ) , a vertex naming is a capacity from V to an arrangement of marks.
Xiujun Zhang +3 more
doaj +1 more source
On the near wake of a Formula One front wheel [PDF]
, 2013 Velocity measurements were made in the near wake of the front wheel of a Formula One car using a laser Doppler anemometer. Tests were carried out on a 50% scale in a closed-return three-quarter open-jet wind tunnel. Three configurations were investigated
Knowles, Kevin +2 more
core +1 more source
The Effect of Profiles on Wheel and Rail Damage [PDF]
, 2009 This paper outlines the historical development of the wheel and rail profiles currently used on railway vehicles. It also presents the key damage mechanisms involved in wheel-rail contact and summarises the methods that have recently been developed by ...
Simon D. Iwnicki, Iwnicki, S.
core +1 more source
Prime labeling in the context of web graphs without center
AKCE International Journal of Graphs and Combinatorics, 2021 A prime labeling on a graph G of order n is a bijection from the set of vertices of G into the set of first n positive integers such that any two adjacent vertices in G have relatively prime labels.
A. N. Kansagara, S. K. Patel
doaj +1 more source
Turning the Wheel Catalog of Books and Kits [PDF]
, 1997 1 Electronic records. 4 pages. 1.28 MB, 1341080 bytes.A catalog of books and kits aimed at children to teach them the Wheel of the Year. Turning the Wheel. Turning the Wheel Catalog of Books and Kits. (Portland, OR: Turning the Wheel, 1997?).
Turning the Wheel
core +2 more sources
European Journal of Combinatorics, 2015 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.
Aboulker, Pierre +3 more
openaire +2 more sources
On equitable coloring of corona of wheels
Electronic Journal of Graph Theory and Applications, 2016 The notion of equitable colorability was introduced by Meyer in $1973$ \cite{meyer}. In this paper we obtain interesting results regarding the equitable chromatic number $\chi_{=}$ for the corona graph of a simple graph with a wheel graph $G\circ W_n ...
J. Vernold Vivin, K. Kaliraj
doaj +1 more source