Broadcast independence and packing in certain classes of trees
Fuente:
arXiv
Saved in:
| Main Authors: | Brewster, Richard C., McDonald, Kiara A. |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Domination and packing in graphs
by: Dúcz, Ákos, et al.
Published: (2026)
by: Dúcz, Ákos, et al.
Published: (2026)
Induced matching vs edge open packing: trees and product graphs
by: Bresar, Bostjan, et al.
Published: (2024)
by: Bresar, Bostjan, et al.
Published: (2024)
Maximal independent sets in graphs with given matching number
by: Shi, Yongtang, et al.
Published: (2024)
by: Shi, Yongtang, et al.
Published: (2024)
Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
by: Cambie, Stijn, et al.
Published: (2023)
by: Cambie, Stijn, et al.
Published: (2023)
List packing number of bounded degree graphs
by: Cambie, Stijn, et al.
Published: (2023)
by: Cambie, Stijn, et al.
Published: (2023)
Resonance graphs that are daisy cubes: from hypercubes to independent sets via resonant sets
by: Brezovnik, Simon, et al.
Published: (2024)
by: Brezovnik, Simon, et al.
Published: (2024)
A necessary and sufficient condition for bounds on the sum of a list of real numbers and its applications
by: Yang, Xiwu
Published: (2024)
by: Yang, Xiwu
Published: (2024)
$k$-fault-tolerant graphs for $p$ disjoint complete graphs of order $c$
by: Cichacz, Sylwia, et al.
Published: (2022)
by: Cichacz, Sylwia, et al.
Published: (2022)
The minimum number of vertices and edges of connected graphs with ind-match$(G) = p$, min-match$(G) = q$ and match$(G) = r$
by: Matsuda, Kazunori, et al.
Published: (2025)
by: Matsuda, Kazunori, et al.
Published: (2025)
Critical edge sets in vertex-critical graphs
by: Skottova, Ema, et al.
Published: (2025)
by: Skottova, Ema, et al.
Published: (2025)
On the number of triangles in $K_4$-free graphs
by: He, Jialin, et al.
Published: (2025)
by: He, Jialin, et al.
Published: (2025)
Balanced Domination in Convex Polytopes, Trees, and Grid Graphs
by: Nikolic, Bojan, et al.
Published: (2025)
by: Nikolic, Bojan, et al.
Published: (2025)
A Counterexample to a Conjecture of Lovász
by: Clow, Alexander, et al.
Published: (2025)
by: Clow, Alexander, et al.
Published: (2025)
Contractible independence complexes of trees
by: Pham, My Hanh, et al.
Published: (2026)
by: Pham, My Hanh, et al.
Published: (2026)
Broadcast independence number of oriented circulant graphs
by: Laouar, Abdelamin, et al.
Published: (2024)
by: Laouar, Abdelamin, et al.
Published: (2024)
Constructive characterizations concerning total outer-independent domination in subdivision trees
by: Cabrera-Martínez, A., et al.
Published: (2026)
by: Cabrera-Martínez, A., et al.
Published: (2026)
A Critical Probability for Biclique Partition of $G_{n,p}$
by: Bohman, Tom, et al.
Published: (2022)
by: Bohman, Tom, et al.
Published: (2022)
On k-(total) limited packing in graphs
by: Ahmadi, Azam Sadat, et al.
Published: (2024)
by: Ahmadi, Azam Sadat, et al.
Published: (2024)
The odd independence number of graphs, I: Foundations and classical classes
by: Caro, Yair, et al.
Published: (2025)
by: Caro, Yair, et al.
Published: (2025)
Irreversible $k$-Threshold Dynamics on Corona and Base-$b$ Corona Product Graphs
by: Moon, Eric J., et al.
Published: (2025)
by: Moon, Eric J., et al.
Published: (2025)
Neighborhood Balanced 3-Coloring
by: Minyard, Mitchell, et al.
Published: (2024)
by: Minyard, Mitchell, et al.
Published: (2024)
Distribution of independent sets in perfect $r$-ary trees
by: Iľkovič, Daniel, et al.
Published: (2026)
by: Iľkovič, Daniel, et al.
Published: (2026)
A dual view of Roman Domination: The 2-limited packing problem
by: Bachtler, Oliver, et al.
Published: (2026)
by: Bachtler, Oliver, et al.
Published: (2026)
Characterization of sparse monotone graph classes with bounded domination-to-2-independence ratio
by: Bonamy, Marthe, et al.
Published: (2026)
by: Bonamy, Marthe, et al.
Published: (2026)
Domination and Total Domination Numbers in Zero-divisor Graphs of Commutative Rings
by: Anderson, Sarah, et al.
Published: (2025)
by: Anderson, Sarah, et al.
Published: (2025)
Total coloring of regular graphs of girth = degree + 1
by: Dejter, Italo J.
Published: (2024)
by: Dejter, Italo J.
Published: (2024)
Efficient total colorings of cubic maps of girth 4 and related topics
by: Dejter, Italo J
Published: (2026)
by: Dejter, Italo J
Published: (2026)
On the independence number in subcubic graphs
by: Harant, Jochen, et al.
Published: (2025)
by: Harant, Jochen, et al.
Published: (2025)
Unique paired vs edge-vertex minimum dominating sets in trees
by: Miotk, Mateusz, et al.
Published: (2025)
by: Miotk, Mateusz, et al.
Published: (2025)
The minimum number of maximal independent sets in twin-free graphs
by: Cambie, Stijn, et al.
Published: (2022)
by: Cambie, Stijn, et al.
Published: (2022)
Hypergraph independence polynomials with a zero close to the origin
by: Zhang, Shengtong
Published: (2023)
by: Zhang, Shengtong
Published: (2023)
Identifying codes in graphs of given maximum degree: Characterizing trees
by: Chakraborty, Dipayan, et al.
Published: (2024)
by: Chakraborty, Dipayan, et al.
Published: (2024)
The family of all local maximum independent sets is an augmentoid
by: Levit, Vadim E., et al.
Published: (2026)
by: Levit, Vadim E., et al.
Published: (2026)
Counting independent sets in regular graphs with bounded independence number
by: Galvin, David, et al.
Published: (2024)
by: Galvin, David, et al.
Published: (2024)
Lower bounds on the independence number of a graph in terms of degrees
by: Harant, Jochen, et al.
Published: (2025)
by: Harant, Jochen, et al.
Published: (2025)
On 1-Konig-Egervary Graphs
by: Levit, Vadim E., et al.
Published: (2023)
by: Levit, Vadim E., et al.
Published: (2023)
Cliques and independent subgroups of the Birkhoff polytope graph
by: Huang, Zejun, et al.
Published: (2022)
by: Huang, Zejun, et al.
Published: (2022)
Paired domination in trees: A linear algorithm and asymptotic normality
by: Henning, Michael A., et al.
Published: (2025)
by: Henning, Michael A., et al.
Published: (2025)
Upper bound for the number of maximal dissociation sets in trees
by: Wang, Ziyuan, et al.
Published: (2024)
by: Wang, Ziyuan, et al.
Published: (2024)
Graphs with core(G) = nucleus(G)
by: Levit, Vadim E., et al.
Published: (2026)
by: Levit, Vadim E., et al.
Published: (2026)
Similar Items
-
Domination and packing in graphs
by: Dúcz, Ákos, et al.
Published: (2026) -
Induced matching vs edge open packing: trees and product graphs
by: Bresar, Bostjan, et al.
Published: (2024) -
Maximal independent sets in graphs with given matching number
by: Shi, Yongtang, et al.
Published: (2024) -
Packing colourings in complete bipartite graphs and the inverse problem for correspondence packing
by: Cambie, Stijn, et al.
Published: (2023) -
List packing number of bounded degree graphs
by: Cambie, Stijn, et al.
Published: (2023)