Minimum partition of an r-independence system

DOI10.1155/2021/7163840MaRDI QIDQ2666441zbMATH OpenOpenAlexFDO

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

Publication date 22 November 2021

Published in Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2021/7163840

Mathematics Subject Classification ID

Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

Summary: Graph partitioning has been studied in the discipline between computer science and applied mathematics. It is a technique to distribute the whole graph data as a disjoint subset to a different device. The minimum graph partition problem with respect to an independence system of a graph has been studied in this paper. The considered independence system consists of one of the independent sets defined by Boutin. We solve the minimum partition problem in path graphs, cycle graphs, and wheel graphs. We supply a relation of twin vertices of a graph with its independence system. We see that a maximal independent set is not always a minimal set in some situations. We also provide realizations about the maximum cardinality of a minimum partition of the independence system. Furthermore, we study the comparison of the metric dimension problem of a graph with the minimum partition problem of that graph.

Recommendations

• Minimum partition of an independence system into independent sets
• scientific article; zbMATH DE number 404527
• Recent examples in the theory of partition graphs
• On partition graphs
• Minimum height path partitioning of trees

Cites work

• k-metric antidimension: a privacy measure for social graphs
• Determining sets, resolving sets, and the exchange property
• Extremal graph theory for metric dimension and diameter
• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Landmarks in graphs
• Mastermind
• Minimum partition of an independence system into independent sets
• On \(k\)-dimensional graphs and their bases
• On Metric Generators of Graphs
• On the Metric Dimension of Cartesian Products of Graphs
• On the metric dimension of generalized tensor product of interval with paths and cycles
• Resolvability in circulant graphs
• Resolvability in graphs and the metric dimension of a graph

Cited in

(2)

• Minimum partition of an independence system into independent sets
• scientific article; zbMATH DE number 2230919 (Why is no real title available?)

This page was built for publication: Minimum partition of an \(r\)-independence system

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