Further results on the lower bound on reduced Zagreb index of trees
Fuente:
arXiv
Saved in:
| Main Authors: | Bašić, Milan, Ilić, Aleksandar |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Maximum values of the Sombor-index-like graph invariants of trees and connected graphs
by: Bašić, Milan
Published: (2023)
by: Bašić, Milan
Published: (2023)
IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters
by: Cameron, Thomas R., et al.
Published: (2025)
by: Cameron, Thomas R., et al.
Published: (2025)
Totally equimodular matrices: decomposition and triangulation
by: Chervet, Patrick, et al.
Published: (2025)
by: Chervet, Patrick, et al.
Published: (2025)
Closeness Centralities of Lollipop Graphs
by: Dangalchev, Chavdar
Published: (2023)
by: Dangalchev, Chavdar
Published: (2023)
New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization
by: Tanaka, Masato, et al.
Published: (2021)
by: Tanaka, Masato, et al.
Published: (2021)
Signed double Roman domination on cubic graphs
by: Iurlano, Enrico, et al.
Published: (2023)
by: Iurlano, Enrico, et al.
Published: (2023)
On the redundancy of transitivity constraints in the clique partitioning problem
by: Sukegawa, Noriyoshi
Published: (2026)
by: Sukegawa, Noriyoshi
Published: (2026)
Perfect Graph Modification Problems: An Integer Programming Approach
by: Erdem, Burak Nur, et al.
Published: (2025)
by: Erdem, Burak Nur, et al.
Published: (2025)
Computational methods for finding bi-regular cages
by: Goedgebeur, Jan, et al.
Published: (2024)
by: Goedgebeur, Jan, et al.
Published: (2024)
On the sparsity of binary numbers
by: Zhu, Meijun
Published: (2024)
by: Zhu, Meijun
Published: (2024)
Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
by: Kim, Junyoung, et al.
Published: (2024)
by: Kim, Junyoung, et al.
Published: (2024)
A Computational Search for Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
by: Au, Yu Hin, et al.
Published: (2025)
by: Au, Yu Hin, et al.
Published: (2025)
A Menger-type theorem for two induced paths
by: Albrechtsen, Sandra, et al.
Published: (2023)
by: Albrechtsen, Sandra, et al.
Published: (2023)
New Vertex Ordering Characterizations of Circular-Arc Bigraphs
by: Paul, Indrajit, et al.
Published: (2025)
by: Paul, Indrajit, et al.
Published: (2025)
Thresholds of Queen covers
by: Adhikari, Tirthankar, et al.
Published: (2025)
by: Adhikari, Tirthankar, et al.
Published: (2025)
Word-Representability of Graphs with respect to Split Recomposition
by: Dwary, Tithi, et al.
Published: (2024)
by: Dwary, Tithi, et al.
Published: (2024)
Sharp Bounds for Generalized Zagreb Indices of Graphs
by: Vaidya, Sanju, et al.
Published: (2024)
by: Vaidya, Sanju, et al.
Published: (2024)
Small-scale operations on graphic sequences
by: Rusu, Irena
Published: (2026)
by: Rusu, Irena
Published: (2026)
Large independent sets in recursive Markov random graphs
by: Gupte, Akshay, et al.
Published: (2022)
by: Gupte, Akshay, et al.
Published: (2022)
Symmetric properties and two variants of shuffle-cubes
by: Lü, Huazhong, et al.
Published: (2021)
by: Lü, Huazhong, et al.
Published: (2021)
The Schrijver system of the length polyhedron of an interval order
by: Kézdy, André E., et al.
Published: (2024)
by: Kézdy, André E., et al.
Published: (2024)
Fault Tolerant Metric Dimensions of Leafless Cacti Graphs with Application in Supply Chain Management
by: Asif, Tauseef, et al.
Published: (2024)
by: Asif, Tauseef, et al.
Published: (2024)
Extending the definition of set tolerances
by: Jäger, Gerold, et al.
Published: (2024)
by: Jäger, Gerold, et al.
Published: (2024)
Moment generating functions in combinatorial optimization: Bipartite matching
by: Wästlund, Johan
Published: (2026)
by: Wästlund, Johan
Published: (2026)
Minimal $L^p$-congestion spanning trees on weighted graphs
by: Lafuente, Alberto Castejón, et al.
Published: (2025)
by: Lafuente, Alberto Castejón, et al.
Published: (2025)
Strong SDP based bounds on the cutwidth of a graph
by: Gaar, Elisabeth, et al.
Published: (2023)
by: Gaar, Elisabeth, et al.
Published: (2023)
Totally $Δ$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
by: McFarland, Caleb
Published: (2026)
by: McFarland, Caleb
Published: (2026)
Stable Set Polytopes with Rank $|V(G)|/3$ for the Lovász--Schrijver SDP Operator
by: Au, Yu Hin, et al.
Published: (2025)
by: Au, Yu Hin, et al.
Published: (2025)
Weighted domination models and randomized heuristics
by: Dijkstra, Lukas, et al.
Published: (2022)
by: Dijkstra, Lukas, et al.
Published: (2022)
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph
by: Chiarelli, Nina, et al.
Published: (2023)
by: Chiarelli, Nina, et al.
Published: (2023)
Eccentric Connectivity Index of Strongly Connected Digraphs
by: Chakooth, Vysakh, et al.
Published: (2025)
by: Chakooth, Vysakh, et al.
Published: (2025)
Implied Integrality in Mixed-Integer Optimization
by: van der Hulst, Rolf, et al.
Published: (2025)
by: van der Hulst, Rolf, et al.
Published: (2025)
Infinite families of planar graphs of a given injective chromatic number
by: Daneels, Matias, et al.
Published: (2024)
by: Daneels, Matias, et al.
Published: (2024)
Circular Directional Flow Decomposition of Networks
by: Homs-Dones, Marc, et al.
Published: (2025)
by: Homs-Dones, Marc, et al.
Published: (2025)
Relaxations for binary polynomial optimization via signed certificates
by: Xu, Liding, et al.
Published: (2024)
by: Xu, Liding, et al.
Published: (2024)
SAT-Based Search for Minwise Independent Families
by: Iurlano, Enrico, et al.
Published: (2024)
by: Iurlano, Enrico, et al.
Published: (2024)
Polyhedral approach to weighted connected matchings in general graphs
by: Samer, Phillippe, et al.
Published: (2023)
by: Samer, Phillippe, et al.
Published: (2023)
An Integer Linear Programming Model for the Evolomino Puzzle
by: Nikolaev, Andrei V., et al.
Published: (2026)
by: Nikolaev, Andrei V., et al.
Published: (2026)
Heuristic algorithms for the stochastic critical node detection problem
by: Bayarsaikhan, Tuguldur, et al.
Published: (2025)
by: Bayarsaikhan, Tuguldur, et al.
Published: (2025)
Solving Combinatorial Pricing Problems using Embedded Dynamic Programming Models
by: Bui, Quang Minh, et al.
Published: (2024)
by: Bui, Quang Minh, et al.
Published: (2024)
Similar Items
-
Maximum values of the Sombor-index-like graph invariants of trees and connected graphs
by: Bašić, Milan
Published: (2023) -
IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters
by: Cameron, Thomas R., et al.
Published: (2025) -
Totally equimodular matrices: decomposition and triangulation
by: Chervet, Patrick, et al.
Published: (2025) -
Closeness Centralities of Lollipop Graphs
by: Dangalchev, Chavdar
Published: (2023) -
New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization
by: Tanaka, Masato, et al.
Published: (2021)