Extremal vertex-degree function index with given order and dissociation number
From MaRDI portal
Publication:6184319
DOI10.1016/J.DAM.2023.09.005OpenAlexW4386976163MaRDI QIDQ6184319
No author found.
Publication date: 24 January 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.09.005
Trees (05C05) Enumeration in graph theory (05C30) Paths and cycles (05C38) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal trees of given segment sequence with respect to some eccentricity-based invariants
- On the minimal eccentric connectivity indices of bipartite graphs with some given parameters
- Unified extremal results of topological indices and spectral invariants of graphs
- Maximal and maximum dissociation sets in general and triangle-free graphs
- Sharp bounds on the arithmetic-geometric index of graphs and line graphs
- The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain
- Extremal vertex-degree function index for trees and unicyclic graphs with given independence number
- Minimum \(k\)-path vertex cover
- The complexity of dissociation set problems in graphs
- NP-hard graph problems and boundary classes of graphs
- Independent packings in structured graphs
- Node-Deletion Problems on Bipartite Graphs
- The complexity of restricted spanning tree problems
- The maximum number of maximum dissociation sets in trees
This page was built for publication: Extremal vertex-degree function index with given order and dissociation number