Results 11 to 20 of about 317 (167)
Edge odd graceful labeling of some path and cycle related graphs
AKCE International Journal of Graphs and Combinatorics, 2017 Solairaju and Chithra introduced a new type of labeling of a graph with vertices and edges called an edge odd graceful labeling if there is a bijection from the edges of the graph to the set such that, when each vertex is assigned the sum of all edges ...
S.N. Daoud
doaj +1 more source
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
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
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
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
Shock and Vibration, 2016 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 +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
On Antimagic Labeling for Some Families of Graphs
Ibn Al-Haitham Journal for Pure and Applied Sciences, 2023 Antimagic labeling of a graph with vertices and edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph are pairwise distinct.
Noor K. Shawkat, Mohammed A. Ahmed
doaj +1 more source
Fundamental study of cornering limit characteristics during braking and driving
Nihon Kikai Gakkai ronbunshu, 2016 The G-G diagram is one way of expressing the cornering limit during braking or driving. When limit driving data is plotted on a graph with the 2 axes representing longitudinal acceleration and lateral acceleration, the shape of the graph indicates the ...
Hideki SAKAI
doaj +1 more source