Cover Image

Link Residual Closeness of Harary Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Dangalchev, Ch.
Format:	Preprint
Published:	2023
Subjects:	Discrete Mathematics 90C35
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Closeness of Some Graph Operations
by: Dangalchev, Chavdar
Published: (2023)

Closeness Centralities of Lollipop Graphs
by: Dangalchev, Chavdar
Published: (2023)

Closeness and Decision Making
by: Dangalchev, Chavdar
Published: (2026)

Closeness and Residual Closeness of Harary Graphs
by: Golpek, Hande Tuncel, et al.
Published: (2023)

New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization
by: Tanaka, Masato, et al.
Published: (2021)

Moment generating functions in combinatorial optimization: Bipartite matching
by: Wästlund, Johan
Published: (2026)

Robust Graph-Based Semi-Supervised Learning via $p$-Conductances
by: Robertson, Sawyer Jack, et al.
Published: (2025)

Signed double Roman domination on cubic graphs
by: Iurlano, Enrico, et al.
Published: (2023)

Eccentric Connectivity Index of Strongly Connected Digraphs
by: Chakooth, Vysakh, et al.
Published: (2025)

Invariant Polydiagonal Subspaces of Matrices and Constraint Programming
by: Neuberger, John M., et al.
Published: (2024)

Extending the definition of set tolerances
by: Jäger, Gerold, et al.
Published: (2024)

A Bellman-Ford algorithm for the path-length-weighted distance in graphs
by: Arnau, R., et al.
Published: (2024)

A counterexample to the conjecture on Biclique Partition number of Split Graphs and related problems
by: Babu, Anand, et al.
Published: (2026)

A Computational Search for Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
by: Au, Yu Hin, et al.
Published: (2025)

Fair Schedules for Single Round Robin Tournaments with Ranked Participants
by: Wessel, Sten, et al.
Published: (2025)

Shared Processor Scheduling of Multiprocessor Jobs
by: Dereniowski, Dariusz, et al.
Published: (2018)

Balanced assignments of periodic tasks
by: Gachet, Héloïse, et al.
Published: (2024)

On Alternating 6-Cycles in Edge-Coloured Graphs
by: Chen, Hao, et al.
Published: (2025)

Perfect Graph Modification Problems: An Integer Programming Approach
by: Erdem, Burak Nur, et al.
Published: (2025)

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
by: Tanınmış, Kübra, et al.
Published: (2023)

Computational methods for finding bi-regular cages
by: Goedgebeur, Jan, et al.
Published: (2024)

Graph burning: an overview of mathematical programs
by: Cajica-Maceda, Lourdes Beatriz, et al.
Published: (2025)

Fault Tolerant Metric Dimensions of Leafless Cacti Graphs with Application in Supply Chain Management
by: Asif, Tauseef, et al.
Published: (2024)

Strong SDP based bounds on the cutwidth of a graph
by: Gaar, Elisabeth, et al.
Published: (2023)

On different Versions of the Exact Subgraph Hierarchy for the Stable Set Problem
by: Gaar, Elisabeth
Published: (2020)

The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs
by: Gaar, Elisabeth, et al.
Published: (2024)

Computing All Shortest Passenger Routes with a Tropical Dijkstra Algorithm
by: Masing, Berenike, et al.
Published: (2024)

Heuristic algorithms for the stochastic critical node detection problem
by: Bayarsaikhan, Tuguldur, et al.
Published: (2025)

Solving Combinatorial Pricing Problems using Embedded Dynamic Programming Models
by: Bui, Quang Minh, et al.
Published: (2024)

Robust Extensible Bin Packing and Revisiting the Convex Knapsack Problem
by: Goldberg, Noam, et al.
Published: (2025)

On the sparsity of binary numbers
by: Zhu, Meijun
Published: (2024)

4-cop-win graphs have at least 19 vertices
by: Turcotte, Jérémie, et al.
Published: (2020)

Convex quadratic sets and the complexity of mixed integer convex quadratic programming
by: Del Pia, Alberto
Published: (2023)

Competing for the most profitable tour: The orienteering interdiction game
by: Álvarez-Miranda, Eduardo, et al.
Published: (2024)

Adaptive Improvements of Multi-Objective Branch and Bound
by: Bauß, Julius, et al.
Published: (2023)

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
by: Kim, Junyoung, et al.
Published: (2024)

Reducing Dominating Sets in Graphs
by: Inza, Ernesto Parra, et al.
Published: (2024)

Loop unrolling of UCA models: distance labeling
by: Soulignac, Francisco J, et al.
Published: (2022)

Exact solution approaches for the discrete $α$-neighbor $p$-center problem
by: Gaar, Elisabeth, et al.
Published: (2022)

Investigating mixed-integer programming approaches for the $p$-$α$-closest-center problem
by: Gaar, Elisabeth, et al.
Published: (2026)