Image de couverture de livre

Analyzing Network Robustness via Residual Closeness

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Golpek, Hande Tuncel, Bilici, Mehmet Ali, Aytac, Aysun
Format:	Preprint
Publié:	2026
Sujets:	Discrete Mathematics Combinatorics 05C69, 05C76, 68R10
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Closeness and Residual Closeness of Harary Graphs
par: Golpek, Hande Tuncel, et autres
Publié: (2023)

Symmetry classes of Hamiltonian cycles
par: Baligacs, Julia, et autres
Publié: (2025)

Fault-tolerant mutual-visibility: complexity and solutions for grid-like networks
par: Cicerone, Serafino, et autres
Publié: (2025)

The Upper Clique Transversal Problem
par: Milanič, Martin, et autres
Publié: (2023)

An efficient algorithm for generating transmission irregular trees
par: Stošić, Ivan, et autres
Publié: (2025)

Self-identifying codes in direct products of complete graphs with paths and cycles
par: Liu, Jihong, et autres
Publié: (2025)

Reducing Dominating Sets in Graphs
par: Inza, Ernesto Parra, et autres
Publié: (2024)

Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
par: Inoue, Yuta, et autres
Publié: (2024)

Strengthening Wilf's lower bound on clique number
par: Jadav, Hareshkumar, et autres
Publié: (2025)

On Edge-Disjoint Maximal Outerplanar Graphs
par: Okada, Yuto, et autres
Publié: (2026)

Structure of $k$-Matching-Planar Graphs
par: Hendrey, Kevin, et autres
Publié: (2025)

Towards Characterization of 5-List-Colorability of Toroidal Graphs
par: Dvořák, Zdeněk, et autres
Publié: (2024)

New Vertex Ordering Characterizations of Circular-Arc Bigraphs
par: Paul, Indrajit, et autres
Publié: (2025)

The independence ratio of 4-cycle-free planar graphs
par: Kelly, Tom, et autres
Publié: (2023)

Mutual-visibility problems on graphs of diameter two
par: Cicerone, Serafino, et autres
Publié: (2024)

Small-scale operations on graphic sequences
par: Rusu, Irena
Publié: (2026)

Cycles of Well-Linked Sets I: an Elementary Bound for Directed Cycle Packing
par: Hatzel, Meike, et autres
Publié: (2024)

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
par: Furmańczyk, Hanna, et autres
Publié: (2020)

Explicit Formulas and Unimodality Phenomena for General Position Polynomials
par: Rather, Bilal Ahmad
Publié: (2026)

New Optimal Results on Codes for Location in Graphs
par: Junnila, Ville, et autres
Publié: (2023)

Extremal Results on Conflict-free Coloring
par: Bhyravarapu, Sriram, et autres
Publié: (2023)

Symmetric properties and two variants of shuffle-cubes
par: Lü, Huazhong, et autres
Publié: (2021)

Improved bounds for acyclic coloring parameters
par: Kirousis, Lefteris, et autres
Publié: (2022)

Paired many-to-many 2-disjoint path cover of Johnson graphs
par: Liu, Jinhao, et autres
Publié: (2025)

Degree Realization by Bipartite Multigraphs
par: Bar-Noy, Amotz, et autres
Publié: (2025)

The damage number of the Cartesian product of graphs
par: Huggan, Melissa A., et autres
Publié: (2023)

Contributions to conjectures on planar graphs: Induced Subgraphs, Treewidth, and Dominating Sets
par: Enami, Kengo, et autres
Publié: (2025)

Catching Rats in $H$-minor-free Graphs
par: Gorsky, Maximilian, et autres
Publié: (2025)

The basis number of 1-planar graphs
par: Bazargani, Saman, et autres
Publié: (2024)

Weighted domination models and randomized heuristics
par: Dijkstra, Lukas, et autres
Publié: (2022)

Circular-arc H-graphs: Ordering Characterizations and Forbidden Patterns
par: Paul, Indrajit, et autres
Publié: (2025)

An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
par: Mkrtchyan, Vahan
Publié: (2024)

$(t,r)$ Broadcast Domination Numbers and Densities of the Truncated Square Tiling Graph
par: Cervantes, Jillian, et autres
Publié: (2024)

Temporal Exploration of Random Spanning Tree Models
par: Baguley, Samuel, et autres
Publié: (2025)

A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor
par: Milanič, Martin, et autres
Publié: (2024)

Quickly excluding an annotated planar graph
par: Gorsky, Maximilian, et autres
Publié: (2026)

The price of homogeneity is polynomial
par: Gorsky, Maximilian, et autres
Publié: (2026)

Infinite families of planar graphs of a given injective chromatic number
par: Daneels, Matias, et autres
Publié: (2024)

Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
par: Gollin, J. Pascal, et autres
Publié: (2023)

Bell Numbers and Stirling Numbers of the Mycielskian of Trees
par: Allagan, J., et autres
Publié: (2025)