Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time
From MaRDI portal
Publication:6087804
DOI10.1002/num.22736OpenAlexW3116782256WikidataQ115397436 ScholiaQ115397436MaRDI QIDQ6087804
Publication date: 12 December 2023
Published in: Numerical Methods for Partial Differential Equations (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/num.22736
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tenacity of a graph with maximum connectivity
- The neighbour-scattering number can be computed in polynomial time for interval graphs
- Optimal K-secure graphs
- A survey of integrity
- On a class of posets and the corresponding comparability graphs
- Computing the weighted isolated scattering number of interval graphs in polynomial time
- A polynomial algorithm for weighted scattering number in interval graphs
- Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
- Neighbor Isolated Tenacity of Graphs
- A Characterization of Comparability Graphs and of Interval Graphs
This page was built for publication: Computing the weighted neighbor isolated tenacity of interval graphs in polynomial time