Results 21 to 30 of about 174,518,636 (296)

Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements [PDF]

open access: yes, 2014
We consider degree bounded network design problems with element and vertex connectivity requirements. In the degree bounded Survivable Network Design (SNDP) problem, the input is an undirected graph G = (V, E) with weights w(e) on the edges and degree ...
Ali Vakilian   +3 more
core   +1 more source

Estimation of vertex degrees in a sampled network [PDF]

open access: yes2017 51st Asilomar Conference on Signals, Systems, and Computers, 2017
The need to produce accurate estimates of vertex degree in a large network, based on observation of a subnetwork, arises in a number of practical settings. We study a formalized version of this problem, wherein the goal is, given a randomly sampled subnetwork from a large parent network, to estimate the actual degree of the sampled nodes.
Apratim Ganguly, Eric D. Kolaczyk
openaire   +3 more sources

On Vertex-Degree-Based Indices of Monogenic Semigroup Graphs

open access: yes, 2022
Albertson and the reduced Sombor indices are vertex-degree-based graph invariants that given ...
Ünal, Seda Oğuz   +2 more
core   +1 more source

Minimum 2SAT-DELETION: inapproximability results and relations to Minimum Vertex Cover [PDF]

open access: yes, 2007
The MINIMUM 2SAT-DELETION problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems Khanna et al.
Chlebikova, Janka   +3 more
core   +1 more source

Complexity of approximating bounded variants of optimization problems [PDF]

open access: yes, 2006
We study low degree graph problems such as Maximum Independent Set and Minimum Vertex Cover. The goal is to improve approximation lower bounds for them and for a number of related problems like Max-B-Set Packing, Min-B-Set Cover, and Max-B-Dimensional ...
Chlebikova, Janka   +3 more
core   +1 more source

On K-Banhatti indices and entropy measure for rhodium (III) chloride via linear regression models

open access: yesHeliyon, 2023
Rhodium (III) chloride is a metallic compound characterized by its shiny and silvery-white appearance. It possesses high reflectivity and exhibits excellent resistance to corrosion.
Mazhar Hussain   +5 more
doaj   +1 more source

On Extended Adjacency Index with Respect to Acyclic, Unicyclic and Bicyclic Graphs

open access: yesMathematics, 2019
For a (molecular) graph G, the extended adjacency index E A ( G ) is defined as Equation (1). In this paper we introduce some graph transformations which increase or decrease the extended adjacency ( E A ) index.
Bin Yang   +4 more
doaj   +1 more source

Vertex Graceful Labeling-Some Path Related Graphs [PDF]

open access: yes, 2013
Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, Smarandachely vertex m ...
Balaganesan, P.   +2 more
core   +1 more source

Reformulated Zagreb Indices of Some Derived Graphs

open access: yesMathematics, 2019
A topological index is a numeric quantity that is closely related to the chemical constitution to establish the correlation of its chemical structure with chemical reactivity or physical properties.
Jia-Bao Liu   +4 more
doaj   +1 more source

Vertex arboricity and maximum degree

open access: yesDiscrete Mathematics, 1995
This paper mainly proves that if a connected graph \(G= (V,E)\) is neither a cycle nor a clique, then there is a coloring of \(V\) with at most \(\lceil {{\Delta (G)} \over 2} \rceil\) colors such that all color classes induce forests and one of them is a minimum induced forest in \(G\).
Paul A. Catlin, Hong-Jian Lai
openaire   +2 more sources

Home - About - Disclaimer - Privacy