Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Dominance graph of binary words

From MaRDI portal
Publication:5212249
Jump to:navigation, search

DOI10.22055/JAMM.2019.26702.1616zbMATH Open1463.05422OpenAlexW2980335988MaRDI QIDQ5212249FDOQ5212249


Authors: Soheila Nasouri, F. Shaveisi Edit this on Wikidata


Publication date: 27 January 2020


Full work available at URL: https://jamm.scu.ac.ir/article_14778_b460607ff30451796447b02bd9491699.pdf




Recommendations

  • On \((d,2)\)-dominating numbers of binary undirected de Bruijn graphs
  • scientific article; zbMATH DE number 90561
  • Dominated error correcting codes with distance two
  • scientific article; zbMATH DE number 4134077
  • BOUNDS ON THE DOMINATION NUMBER OF A GRAPH


zbMATH Keywords

chromatic numberdiametergirthradiusindependence numberdominance graph of binary words


Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorics on words (68R15)



Cited In (1)

  • Title not available (Why is that?)





This page was built for publication: Dominance graph of binary words

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5212249&oldid=19820653"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 17:39. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki