Feasibility of data transmission under attack: from isolated toughness variant perspective

DOI10.1134/s0032946023020060zbMath1530.94009OpenAlexW4390148083MaRDI QIDQ6148194

Carlo Cattani, Wei Gao, Haci Mehmet Baskonus

Publication date: 11 January 2024

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946023020060

zbMATH Keywords

networkinformation theoryfractional \((a, b, n)\)-critical graphisolated toughness variant

Mathematics Subject Classification ID

Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Information theory (general) (94A15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On toughness and fractional \((g,f,n)\)-critical graphs
• Toughness and the existence of \(k\)-factors. III
• Tight isolated toughness bound for fractional \((k, n)\)-critical graphs
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• Discussion on fractional \((a, b, k)\)-critical covered graphs
• On path-factor critical deleted (or covered) graphs
• A note on fractional ID-\( [ a , b \)-factor-critical covered graphs]
• Tough graphs and Hamiltonian circuits.
• New isolated toughness condition for fractional $(g,f,n)$-critical graphs
• Isolated toughness variant and fractional κ-factor
• Independence number and connectivity for fractional (a, b, k)-critical covered graphs
• The binding number of a graph and its Anderson number

This page was built for publication: Feasibility of data transmission under attack: from isolated toughness variant perspective