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
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 ...
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...
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 ...
COMPUTER‐DESIGNED WIENER FILTERS FOR SEISMIC DATA
COMPUTER‐DESIGNED WIENER FILTERS FOR SEISMIC DATA
This paper is concerned with differences in the frequency content of signal and noise on seismic traces. In order to develop a filter which has applicability over some considerable...
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...
Model-checking ecological state-transition graphs
Model-checking ecological state-transition graphs
AbstractModel-checking is a methodology developed in computer science to automatically assess the dynamics of discrete systems, by checking if a system modelled as a state-transiti...
A Systematic Review on Knowledge Graphs Classification and Their Various Usages
A Systematic Review on Knowledge Graphs Classification and Their Various Usages
A Knowledge Graph is a directive graph where the nodes state the entities and the edges describe the relationships between the entities of data. It is also referred to as a Semanti...