Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Ordering Unicyclic Connected Graphs with Girth g ≥ 3 Having Greatest SK Indices
View through CrossRef
For a graph, the SK index is equal to the half of the sum of the degrees of the vertices, the SK1 index is equal to the half of the product of the degrees of the vertices, and the SK2 index is equal to the half of the square of the sum of the degrees of the vertices. This paper shows a simple and unified approach to the greatest SK indices for unicyclic graphs by using some transformations and characterizes these graphs with the first, second, and third SK indices having order r ≥ 5 and girth g ≥ 3, where girth is the length of the shortest cycle in a graph.
Title: Ordering Unicyclic Connected Graphs with Girth g ≥ 3 Having Greatest SK Indices
Description:
For a graph, the SK index is equal to the half of the sum of the degrees of the vertices, the SK1 index is equal to the half of the product of the degrees of the vertices, and the SK2 index is equal to the half of the square of the sum of the degrees of the vertices.
This paper shows a simple and unified approach to the greatest SK indices for unicyclic graphs by using some transformations and characterizes these graphs with the first, second, and third SK indices having order r ≥ 5 and girth g ≥ 3, where girth is the length of the shortest cycle in a graph.
Related Results
Extremal Gourava indices of unicyclic graphs
Extremal Gourava indices of unicyclic graphs
Abstract
Topological indices are useful molecular descriptors to measure Quantitative Structure-Activity Relationship (QSAR), Quantitative Structure-Property Relationship (...
Effects of Planting Density on Growth and Yield Attributes of Rubber Trees (Hevea brasiliensis)
Effects of Planting Density on Growth and Yield Attributes of Rubber Trees (Hevea brasiliensis)
This study aimed to identify rubber clones, suitable for rubber-timber production. An experiment was established in randomized complete block design to evaluate the effects of two ...
Algorithms for Computing Wiener Indices of Acyclic and Unicyclic Graphs
Algorithms for Computing Wiener Indices of Acyclic and Unicyclic Graphs
Let G = (V(G), E(G)) be a molecular graph, where V(G) and E(G) are the sets of vertices (atoms) and edges (bonds). A topological index of a molecular graph is a numerical quantity ...
Effects of In-Service Strain on Girth Weld Failure of an X80 Pipeline
Effects of In-Service Strain on Girth Weld Failure of an X80 Pipeline
Abstract
In general, transmission pipelines are designed by hoop stress induced by internal pressure, and maximum longitudinal stress. The paper is mainly about the failure...
Determination of Temperature Limits for Heat Exchanger Joint Assembled of Solid Stainless Tubesheet With Girth Flanges
Determination of Temperature Limits for Heat Exchanger Joint Assembled of Solid Stainless Tubesheet With Girth Flanges
Although heat exchangers are built according to international codes and proved to be leak tight by hydrotesting at ambient temperature, leak of stainless steel heat exchangers girt...
Twilight graphs
Twilight graphs
AbstractThis paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite:(a) there is an ...
The upper connected edge geodetic number of a graph
The upper connected edge geodetic number of a graph
For a non-trivial connected graph G, a set S ? V (G) is called an edge
geodetic set of G if every edge of G is contained in a geodesic joining some
pair of vertices in S. The...
On Tuza's conjecture in even co-chain graphs
On Tuza's conjecture in even co-chain graphs
In 1981, Tuza conjectured that the cardinality of a minimum set of edges that intersects every triangle of a graph is at most twice the cardinality of a maximum set of edge-disjoin...