Results 11 to 20 of about 52,307 (305)

Degree conditions for vertex switching reconstruction [PDF]

open access: yesDiscrete Mathematics, 1996
This paper is related to the \(s\)-vertex switching reconstruction problem. If \(G= G(V,E)\) is a graph and \(U \subset V\), the switching \(G_U\) of \(G\) is the graph obtained from \(G\) by replacing all the edges between \(U\) and \(V \backslash U\) with the nonedges.
Krasikov, I.
openaire   +2 more sources

On Bounded-Degree Vertex Deletion parameterized by treewidth [PDF]

open access: yesDiscrete Applied Mathematics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nadja Betzler   +3 more
openaire   +2 more sources

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem [PDF]

open access: yes, 2021
We study the parameterized complexity of the Bounded-Degree Vertex Deletion problem (BDD), where the aim is to find a maximum induced subgraph whose maximum degree is below a given degree bound.
Ordyniak, Sebastian   +4 more
core   +6 more sources

Relating graph energy with vertex-degree-based energies [PDF]

open access: yesVojnotehnički Glasnik, 2020
Introduction/purpose: The paper presents numerous vertex-degree-based graph invariants considered in the literature. A matrix can be associated to each of these invariants.
Ivan Gutman
doaj   +1 more source

PREFERENTIAL ATTACHMENT WITH FITNESS DEPENDENT CHOICE

open access: yesФизико-химические аспекты изучения кластеров, наноструктур и наноматериалов, 2021
We study the asymptotic behavior of the maximum degree in the preferential attachment tree model with a choice based on both the degree and fitness of a vertex.
Y.A. Malyshkin
doaj   +1 more source

On vertex and edge degree-based topological indices

open access: yesVojnotehnički Glasnik, 2023
Introduction/purpose: The entire topological indices (T Ient) are a class of graph invariants depending on the degrees of vertices and edges. Some general properties of these invariants are established.
Ivan Gutman
doaj   +1 more source

Extremal Graphs to Vertex Degree Function Index for Convex Functions [PDF]

open access: yes, 2022
The vertex-degree function index Hf(Γ) is defined as Hf(Γ)=∑v∈V(Γ)f(d(v)) for a function f(x) defined on non-negative real numbers.
Zhen Ji   +3 more
core   +1 more source

On topological properties of hierarchical hypercube network based on Ve and Ev degree

open access: yesMain Group Metal Chemistry, 2021
Grid implementation is a principal unit in electrical and electronic engineering but it depends on the domain of these projects. For example, depending on the grid and the signal processing in that fields of electronic and electrical engineering, such as
Zahra Nida, Ibrahim Muhammad
doaj   +1 more source

The complexity of degree anonymization by vertex addition [PDF]

open access: yesTheoretical Computer Science, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert Bredereck   +5 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy