Generalized Inverse of a Finite Graph

descriptionPublicationkeyboard_double_arrow_right Article 01 Jul 1981Publisher:SAGE PublicationsJournal:Fundamenta Informaticae, volume 4, pages 499-509 (issn: 0169-2968, eissn: 1875-8681,

Copyright policy )

Authors: Marian Mrozek;

doi: 10.3233/fi-1981-4302

Generalized Inverse of a Finite Graph

- Summary
- Subjects
- Metrics

Abstract

We define the optimal generalized inverse of the directed graph, give its construction and prove that the graph has an inverse graph iff its optimal generalized inverse is its inverse. The construction of the optimal generalized inverse may be used in the preparation of the PERT networks by the computer.

Keywords

line graph, PERT networks, dual graph, inverse graph, Graph theory (including graph drawing) in computer science, Directed graphs (digraphs), tournaments, directed graph

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	2
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average