Skip to main content
Log in

On Maximal Det-Independent (Res-Independent) Sets in Graphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

In this writing, we point out some errors made in Boutin (Graphs Combin 25:789–806, 2009), where the author claims that a maximal independent set in a hereditary system is a minimal determining (resolving) set. Further more, the author claims that if the exchange property holds at the level of minimal resolving sets, then, the corresponding hereditary system is a matroid. We give counter examples to disprove both of her claims. Besides, we prove that there exist graphs having such maximal independent sets which are not necessarily determining (resolving) sets. Also, we give necessary and sufficient conditions for a class of graphs to have a maximal independent set which is not minimal determining (resolving).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

Availability of data and material

Not applicable

Code availability

Not applicable

References

  1. Boutin, D.L.: Determining sets, resolving sets and the exchange property. Graphs Combin. 25, 789–806 (2009)

    Article  MathSciNet  Google Scholar 

  2. Boutin, D.L.: Identifying graph automorphism using determining sets. Electron. J. Combin. 13, 1–12 (2006)

    Article  MathSciNet  Google Scholar 

  3. Ćaceres, J., Hernando, C., Mora, M., Pelayo, I.M., Puertas, M.L., Seara, C., Wood, D.R.: On the metric dimension of Cartesian products of graphs. SIAM J. Discrete Math. 21, 423–441 (2007)

    Article  MathSciNet  Google Scholar 

  4. Chartrand, G., Eroh, L., Johnson, M.A., Oellermann, O.R.: Resolvability in graphs and the metric dimension of a graph. Discrete Appl. Math. 105(1–3), 99–113 (2000)

    Article  MathSciNet  Google Scholar 

  5. Hernando, C., Mora, M., Pelayo, I.M., Seera, C., Wood, D.R.: Extremal graph theory for metric dimension and diameter. Electron. J. Combin. 2010, 17 (2010)

    MathSciNet  Google Scholar 

  6. Javaid, I., Fazil, M., Ali, U., Salman, M.: On some parameters related to fixing sets in graphs. J. Prime Res. Math. 14, 1–12 (2018)

    MathSciNet  MATH  Google Scholar 

  7. West, D.B.: Introduction to Graph Theory. Prentice Hall Inc., Upper Saddle River (1996)

    MATH  Google Scholar 

Download references

Funding

No funding available

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Usman Ali.

Ethics declarations

Conflicts of interest

There is no such conflict of interest

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zill-E-Shams, Salman, M. & Ali, U. On Maximal Det-Independent (Res-Independent) Sets in Graphs. Graphs and Combinatorics 38, 44 (2022). https://doi.org/10.1007/s00373-021-02452-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00373-021-02452-0

Keywords

Mathematics Subject Classification

Navigation