Digraphs

Bang-Jensen, J., & Gutin, G. (2008). Digraphs: Theory, Algorithms and Applications. Springer.

Type

Book

Intellectual base

Review or monograph

Year

2008

DOI

10.1007/978-1-84800-998-1

ISBN

9780857290410

DOI registrant

Springer Nature

Link

https://link.springer.com/book/10.1007/978-1-84800-998-1 not authoritativefound

Cited by

3 citations across 3 artifacts.

Domain-specific

• Hasse diagram
  • The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
• Signal-flow graph
  • It represents equations rather than physical component topology, branch direction is causal or functional and Mason’s gain formula assumes the graph’s linear signal relations.
• Strong connectivity augmentation
  • … If a condensation DAG has three source components and two sinks, at least three new edges are necessary and sufficient under unrestricted unweighted augmentation. to A communication topology adds backup directed links so every component can route to every other, subject to allowable endpoints and installation costs..

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. Neither this nor any other of the 3 citations of this work carries a recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:004a21747a91 · see in the full table