Covering codes of a graph associated with a finite vector space

DOI10.1007/S11253-020-01846-2MaRDI QIDQ2214154zbMATH OpenOpenAlexFDO

Authors M. Murtaza, Imran Javaid, Muhammad Fazil

Publication date 6 December 2020

Published in Ukrainian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11253-020-01846-2

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Bounds on codes (94B65) Other types of codes (94B60)

Recommendations

• Identifying and locating-dominating codes on chains and cycles
• scientific article; zbMATH DE number 975337
• On the ensemble of optimal dominating and locating-dominating codes in a graph
• Locating vertices using codes
• Locating-domination and identification

Cites work

• scientific article; zbMATH DE number 3906528 (Why is no real title available?)
• scientific article; zbMATH DE number 4053685 (Why is no real title available?)
• scientific article; zbMATH DE number 4070954 (Why is no real title available?)
• scientific article; zbMATH DE number 4103125 (Why is no real title available?)
• scientific article; zbMATH DE number 2159641 (Why is no real title available?)
• A kind of intersection graph of vector space
• A note on the intersection graph of subspaces of a vector space.
• Automorphism related parameters of a graph assoclated to a finite vector space
• Certain properties of the power graph associated with a finite group.
• Coloring of a non-zero component graph associated with a finite dimensional vector space
• Coloring of commutative rings
• Commuting involution graphs for symmetric groups.
• Discrete sensor placement problems in distribution networks
• Domination and location in acyclic graphs
• Extremal Graph Theory for Metric Dimension and Diameter
• Fault-tolerant locating-dominating sets
• Graphs and Vector Spaces
• Identifying and locating-dominating codes on chains and cycles
• Identifying and locating-dominating codes: NP-completeness results for directed graphs
• Locating-dominating codes: bounds and extremal cardinalities
• Locating-dominating sets of functigraphs
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
• Nonzero Component Graph of a Finite Dimensional Vector Space
• ON THE COMMUTING GRAPH ASSOCIATED WITH THE SYMMETRIC AND ALTERNATING GROUPS
• On Vector Spaces Associated with a Graph
• On a new class of codes for identifying vertices in graphs
• On nonzero component graph of vector spaces over finite fields
• The connectivity of commuting graphs
• The power graph of a finite group
• The zero-divisor graph of a commutative ring
• Undirected power graphs of semigroups
• Vector spaces and the Petersen graph

Cited in

(2)

• Neighborhood distinguishing coloring in graphs
• Commutative rings introduce a class of identifiable graphs

This page was built for publication: Covering codes of a graph associated with a finite vector space

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