Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
NORDHAUS – GADDUM TYPE RESULTS FOR WIENER LIKE INDICES OF GRAPHS
View through CrossRef
A Nordhaus - Gaddum type result is a lower or upper bound on sum or product of a parameter of a graph and its complement. This concept was introduced in 1956 by Nordhaus E. A., Gaddum J. W. Generalized Wiener like indices such as wiener index, Detour index, Reciprocal- wiener index, Harary- wiener index, Hyper- wiener index, Reciprocal- Detour index, Harary- Detour index and Hyper- Detour index have been studied in graph theory. In this paper, Nordhaus – Gaddum type results of these indices for k-Sun graph and four regular graph are presented.
Auricle Technologies, Pvt., Ltd.
Title: NORDHAUS – GADDUM TYPE RESULTS FOR WIENER LIKE INDICES OF GRAPHS
Description:
A Nordhaus - Gaddum type result is a lower or upper bound on sum or product of a parameter of a graph and its complement.
This concept was introduced in 1956 by Nordhaus E.
A.
, Gaddum J.
W.
Generalized Wiener like indices such as wiener index, Detour index, Reciprocal- wiener index, Harary- wiener index, Hyper- wiener index, Reciprocal- Detour index, Harary- Detour index and Hyper- Detour index have been studied in graph theory.
In this paper, Nordhaus – Gaddum type results of these indices for k-Sun graph and four regular graph are presented.
Related Results
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
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 ...
On the reciprocal distance spectrum of edge corona of graphs
On the reciprocal distance spectrum of edge corona of graphs
The reciprocal distance spectrum (Harary spectrum) of a connected graph [Formula: see text] is the multiset of eigenvalues of its reciprocal distance matrix (Harary matrix) [Formul...
Patents and Research Investments: Assessing the Empirical Evidence
Patents and Research Investments: Assessing the Empirical Evidence
A well-developed theoretical literature--dating back at least to Nordhaus (1969)--has analyzed optimal patent policy design. We re-present the core trade-off of the Nordhaus model ...
Nordhaus’s Programming Model of Energy Futures Revisited
Nordhaus’s Programming Model of Energy Futures Revisited
We conduct a small-scale linear programming simulation of an energy future based on the work of Nordhaus. We are able to link our quantity model (a primal model) quite precisely to...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...