On maximal det-independent (res-independent) sets in graphs

DOI10.1007/S00373-021-02452-0MaRDI QIDQ2115159zbMATH OpenOpenAlexFDO

Authors Zill-e-Shams, Muhammad Salman, Usman Ali

Publication date 15 March 2022

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://hal.sorbonne-universite.fr/hal-03250074/file/mmaximal%20%20not%20minimal.pdf

zbMATH Keywords

determining sethereditary systemindependent setresolving set

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Recommendations

• scientific article; zbMATH DE number 20270
• On the third largest number of maximal independent sets of graphs
• Arithmetically maximal independent sets in infinite graphs
• On graphs having maximal independent sets of exactly \(t\) distinct cardinalities
• scientific article; zbMATH DE number 4041936

Cites work

• Determining sets, resolving sets, and the exchange property
• Extremal graph theory for metric dimension and diameter
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Identifying graph automorphisms using determining sets
• On some parameters related to fixing sets in graphs
• On the Metric Dimension of Cartesian Products of Graphs
• Resolvability in graphs and the metric dimension of a graph

Cited in

(1)

• Independent resolving sets in graphs

This page was built for publication: On maximal det-independent (res-independent) sets in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115159)