Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Independence number of iterated line digraphs

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

DOI10.1016/j.disc.2004.08.030zbMath1062.05112OpenAlexW2046024550MaRDI QIDQ1779497

Nicolas Lichiardopol

Publication date: 1 June 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.08.030


zbMATH Keywords

Independent setIndependence numberLine digraph


Mathematics Subject Classification ID

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


Related Items (3)

On the \(k\)-tuple domination of de Bruijn and Kautz digraphs ⋮ On the independence number of Cayley digraphs of rectangular groups ⋮ Miscellaneous Digraph Classes



Cites Work

  • Covering the de Bruijn graph
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Independence number of iterated line digraphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1779497&oldid=14131503"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 08:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki