• DocumentCode
    1324504
  • Title

    Similarity of graphs and enumeration of dissimilar nth order symmetric sign patterns

  • Author

    Thulasiraman, Krishnaiyan

  • Author_Institution
    Concordia Univ., Montreal, Que., Canada
  • Volume
    10
  • Issue
    1
  • fYear
    1985
  • Firstpage
    9
  • Lastpage
    14
  • Abstract
    Introduces the concepts of similarity of nth order symmetric sign patterns and similarity of n-vertex labelled directed graphs. Two sign patterns are similar if and only if their corresponding directed graphs are similar. A formula to count the maximum number of mutually dissimilar directed graphs and two algorithms are presented. One algorithm generates a set of mutually dissimilar directed graphs and the other tests similarity of two directed graphs.
  • Keywords
    directed graphs; multiport networks; network synthesis; algorithms; directed graphs; electrical network theory; graph theory. n-port networks synthesis; symmetric sign patterns; Educational institutions; Gold; Network theory (graphs); Resistance; Symmetric matrices; Testing;
  • fLanguage
    English
  • Journal_Title
    Electrical Engineering Journal, Canadian
  • Publisher
    ieee
  • ISSN
    0700-9216
  • Type

    jour

  • DOI
    10.1109/CEEJ.1985.6593133
  • Filename
    6593133
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1324504