Results 41 to 50 of about 87,339 (166)
Gaussian Tribonacci R-Graceful Labeling of Some Tree Related Graphs
Let r be any natural number. An injective function , where is the Gaussian Tribonacci number in the Gaussian Tribonacci sequence is said to be Gaussian Tribonacci r-graceful labeling if the induced edge labeling such that is bijective.
K Sunitha, M Sheriba
doaj +1 more source
Degree-Based Topological Indices of Generalized Subdivision Double-Corona Product
Graph operations play an important role in constructing complex network structures from simple graphs. Computation of topological indices of these complex structures via graph products is an important task.
Ying Wang +5 more
doaj +1 more source
Further results on (1,0,0)-F-Face magic mean graphs [PDF]
A (1,0,0)-F-Face magic mean labeling is an assignment of labels to the vertices of planar graph such that the mean weight of each face including an exterior face is constant.
A. Meena Kumari, S. Arockiaraj
doaj +1 more source
Trees whose 2-domination subdivision number is 2 [PDF]
A set \(S\) of vertices in a graph \(G = (V,E)\) is a \(2\)-dominating set if every vertex of \(V\setminus S\) is adjacent to at least two vertices of \(S\). The \(2\)-domination number of a graph \(G\), denoted by \(\gamma_2(G)\), is the minimum size of
M. Atapour +2 more
doaj +1 more source
Mixed Linear Layouts of Planar Graphs
A $k$-stack (respectively, $k$-queue) layout of a graph consists of a total order of the vertices, and a partition of the edges into $k$ sets of non-crossing (non-nested) edges with respect to the vertex ordering. In 1992, Heath and Rosenberg conjectured
C Bachmaier +12 more
core +1 more source
Distance Spectra of Some Double Join Operations of Graphs
In literature, several types of join operations of two graphs based on subdivision graph, Q-graph, R-graph, and total graph have been introduced, and their spectral properties have been studied.
B. J. Manjunatha +3 more
doaj +1 more source
Distance Degree Index of Some Derived Graphs
Topological indices are numerical values associated with a graph (structure) that can predict many physical, chemical, and pharmacological properties of organic molecules and chemical compounds.
Jianzhong Xu +6 more
doaj +1 more source
A Multiplicative Version of Forgotten Topological Index [PDF]
In this paper, we present upper bounds for the multiplicative forgotten topological index of several graph operations such as sum, Cartesian product, corona product, composition, strong product, disjunction and symmetric difference in terms of the F ...
Asghar Yousefi +3 more
doaj +1 more source
A Planarity Test via Construction Sequences
Optimal linear-time algorithms for testing the planarity of a graph are well-known for over 35 years. However, these algorithms are quite involved and recent publications still try to give simpler linear-time tests.
A.K. Kelmans +20 more
core +2 more sources
On Wiener Index for Generalised Subdivision Neighbourhood Corona of Graphs
Graph operations such as the corona product play a significant role in analysing and constructing complex networks. In this work, we examine the Wiener index within the framework of generalised subdivision graph operations.
Vimal M., M. K. Pandit, Kalaimurugan G.
doaj +1 more source

