Results 21 to 30 of about 14,956 (263)
Graph colorings and digraph subdivisions [PDF]
Anais do XXXI Concurso de Teses e Dissertações (CTD 2018), 2018 This paper presents our studies on three vertex coloring problems on graphs and on a problem concerning subdivision of digraphs. Given an arbitrarily colored graph G, the convex recoloring problem consists in finding a (re)coloring that minimizes the number of color changes and such that each color class induces a connected subgraph of G.
Phablo F. S. Moura, Yoshiko Wakabayashi
openaire +3 more sources
First reformulated Zagreb indices of some classes of graphs
Karpatsʹkì Matematičnì Publìkacìï, 2018 A topological index of a graph is a parameter related to the graph; it does not depend on labeling or pictorial representation of the graph. Graph operations plays a vital role to analyze the structure and properties of a large graph which is derived ...
V. Kaladevi +2 more
doaj +1 more source
The harmonic index of subdivision graphs [PDF]
Transactions on Combinatorics, 2017 The harmonic index of a graph $G$ is defined as the sum of the weights $frac{2}{deg_G(u)+deg_G(v)}$ of all edges $uv$ of $G$, where $deg_G(u)$ denotes the degree of a vertex $u$ in $G$. In this paper, we study the harmonic index of subdivision
Bibi Naimeh Onagh
doaj +1 more source
Gaussian Tribonacci R-Graceful Labeling of Some Tree Related Graphs
Ratio Mathematica, 2022 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
Journal of Chemistry, 2022 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]
Songklanakarin Journal of Science and Technology (SJST), 2020 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
Subdivision and graph eigenvalues
Linear Algebra and its ApplicationsThis paper investigates the asymptotic nature of graph spectra when some edges of a graph are subdivided sufficiently many times. In the special case where all edges of a graph are subdivided, we find the exact limits of the $k$-th largest and $k$-th smallest eigenvalues for any fixed $k$.
Hitesh Kumar +3 more
openaire +3 more sources
Domination Subdivision and Domination Multisubdivision Numbers of Graphs
Discussiones Mathematicae Graph Theory, 2019 The domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T) ≤ 3 for any tree
Dettlaff Magda +2 more
doaj +1 more source
IEEE Access, 2019 Let G be a connected graph. The subdivision graph S(G) of a graph (G) is the graph obtained by inserting a new vertex into every edge of G. The set of such new vertices is denoted by I(G).
Qun Liu
doaj +1 more source
Journal of Combinatorial Theory, Series B, 1998 Given four distinct vertices in a 4-connected planar graph \(G\), we characterize when the graph \(G\) contains a \(K_4\)-subdivision with the given vertices as its degree three vertices. This result implies the following conjecture of Robertson and Thomas: a 5-connected planar graph has no \(K_4\)-subdivision with specified degree three vertices, if ...
openaire +2 more sources