Results 31 to 40 of about 11,026 (283)
On Subtree Number Index of Generalized Book Graphs, Fan Graphs, and Wheel Graphs [PDF]
Journal of Mathematics, 2021 With generating function and structural analysis, this paper presents the subtree generating functions and the subtree number index of generalized book graphs, generalized fan graphs, and generalized wheel graphs, respectively. As an application, this paper also briefly studies the subtree number index and the asymptotic properties of the subtree ...
Daoqiang Sun +4 more
openaire +3 more sources
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
The spectral determination of the connected multicone graphs
AKCE International Journal of Graphs and Combinatorics, 2021 The main goal of the paper is to answer an unsolved problem. A multicone graph is defined to be the join of a clique and a regular graph, and a wheel as the join of a vertex and a cycle.
Ali Zeydi Abdian +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
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.
Dzido Tomasz, Furmańczyk Hanna
openaire +2 more sources
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
Integrity of Wheel Related Graphs
Punjab University Journal of Mathematics, 2021 If a network modeled by a graph, then there are various graph theoretical parameters used to express the vulnerability of communication networks. One of them is the concept of integrity. In this paper, we determine exact values for the integrity of wheel related graphs.
B. Basavanagoud, Shruti Policepatil
openaire +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
Odd Wheels Are Not Odd-distance Graphs [PDF]
Discrete & Computational Geometry, 2020 AbstractAn odd wheel graph is a graph formed by connecting a new vertex to all vertices of an odd cycle. We answer a question of Rosenfeld and Le by showing that odd wheels cannot be drawn in the plane so that the lengths of the edges are odd integers.
openaire +5 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