Optimization Problems on Threshold Graphs
During the last three decades, different types of decompositions have been processed in the field of graph theory. Among these we mention: decompositions based on the additivity of some characteristics of the graph, decompositions where the adjacency law between the subsets of the partition is known...
Main Authors: | Elena Nechita, Mihai Talmaciu |
---|---|
Format: | Article |
Language: | English |
Published: |
EduSoft publishing
2010-06-01
|
Series: | Brain: Broad Research in Artificial Intelligence and Neuroscience |
Subjects: | |
Online Access: | http://brain.edusoft.ro/index.php/brain/article/view/104 |
Similar Items
-
w-Wiener Polynomials for Width Distance of the Cartesian Product of K2 with Special Graphs
by: Ali Ali, et al.
Published: (2008-12-01) -
w-Wiener Polynomials for Width Distance of Some Special Graphs
by: Ali Ali, et al.
Published: (2007-12-01) -
Peripheral Wiener index of a graph
by: K.P. Narayankar, et al.
Published: (2017-01-01) -
On the Wiener Complexity and the Wiener Index of Fullerene Graphs
by: Andrey A. Dobrynin, et al.
Published: (2019-11-01) -
Vertex-weighted Wiener polynomials of subdivision-related graphs
by: Mahdieh Azari, et al.
Published: (2016-01-01)