Results 21 to 30 of about 11,128 (261)
Zᴋ-Magic Labeling of Path Union of Graphs
Cubo, 2019 For any non-trivial Abelian group $A$ under addition a graph $G$ is said to be $A$-\textit{magic} if there exists a labeling $f:E(G) \to A-\{0\}$ such that, the vertex labeling $f^+$ defined as $f^+(v) = \sum f(uv)$ taken over all edges $uv$ incident ...
P. Jeyanthi +2 more
doaj +1 more source
Certain Energies of Graphs for Dutch Windmill and Double-Wheel Graphs
Journal of Mathematics, 2022 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 +4 more
doaj +1 more source
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
Embedding Complete Bipartite Graphs into Wheel Related Graphs
Journal of Advanced Computational Intelligence and Intelligent Informatics, 2023 This study considers the exact wirelength of embedding complete bipartite graphs into wheel related graphs such as wheel graphs, gear graphs, and helm graphs.
A. Berin Greeni, P. Leo Joshwa
openaire +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
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 +2 more sources
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
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
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
Altitude of wheels and wheel-like graphs
Open Mathematics, 2010 Abstract An edge-ordering of a graph G=(V, E) is a one-to-one mapping f:E(G)→{1, 2, ..., |E(G)|}. A path of length k in G is called a (k, f)-ascent if f increases along the successive edges forming the path. The altitude α(G) of G is the greatest integer k such that for all edge-orderings f, G has a (k, f)-ascent.
Tomasz Dzido, Hanna Furmańczyk
openaire +2 more sources