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

On signed digraphs with all cycles negative

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

DOI10.1016/0166-218X(85)90069-1zbMath0586.05019OpenAlexW2063286154MaRDI QIDQ5903030

J. Richard Lundgren, Frank Harary, John S. Maybee

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0166-218x(85)90069-1

zbMATH Keywords

signed digraphupper digraphs


Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)


Related Items

Negative (and positive) circles in signed graphs: a problem collection, Qualitative stability and solvability of difference equations, The ray nonsingularity of certain uniformly random ray patterns, From qualitative matrices to quantitative restrictions, On signed digraphs with all cycles negative, On maximal sign-nonsingular matrices, Characterizations and applications of the isolated sets of permutations, Sign-nonsingular matrices and even cycles in directed graphs



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Signsolvability revisited
  • Sign solvable graphs
  • Parallel concepts in graph theory
  • Graph-theoretical approach to qualitative solvability of linear systems
  • The Structure of Qualitatively Determinate Relationships
  • Characterizations of signed graphs
  • Qualitative Economics and the Scope of the Correspondence Principle
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5903030&oldid=13097207"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 01:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki