2019
DOI: 10.7151/dmgt.2262
|View full text |Cite
|
Sign up to set email alerts
|

Further results on packing related parameters in graphs

Abstract: Given a graph G = (V, E), a set B ⊆ V (G) is a packing in G if the closed neighborhoods of every pair of distinct vertices in B are pairwise disjoint. The packing number ρ(G) of G is the maximum cardinality of a packing in G. Similarly, open packing sets and open packing number are defined for a graph G by using open neighborhoods instead of closed ones. We give several results concerning the (open) packing number of graphs in this paper. For instance, several bounds on these packing parameters along with some… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…Another reason is that many results for the case k ∈ {1, 2} can be easily generalized to the general case k. Moreover, one may obtain stronger results for the small values of k rather than the large ones. For more evidences on these pieces of information the reader can be referred to [8,17] and [20].…”
Section: Definitionmentioning
confidence: 99%
“…Another reason is that many results for the case k ∈ {1, 2} can be easily generalized to the general case k. Moreover, one may obtain stronger results for the small values of k rather than the large ones. For more evidences on these pieces of information the reader can be referred to [8,17] and [20].…”
Section: Definitionmentioning
confidence: 99%