Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

A graph theoretic approach to similarity relations

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

DOI10.1007/BF02289696zbMATH Open0132.40502OpenAlexW2103050904MaRDI QIDQ2395596FDOQ2395596


Authors: Frank Harary Edit this on Wikidata


Publication date: 1964

Published in: Psychometrika (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02289696





zbMATH Keywords

mathematical biology


Cites Work

  • Representation of a finite graph by a set of intervals on the real line
  • Title not available (Why is that?)
  • Title not available (Why is that?)
  • A metric and an ordering on sets
  • Graph theoretic methods in the management sciences


Cited In (7)

  • On the number of balanced signed graphs
  • A characterisation of rigid circuit graphs
  • Some applications of graph theory to clustering
  • Betweenness, orders and interval graphs
  • Asymptotic distributions in random graphs with applications to social networks
  • Clique optimization: A method to construct parsimonious ultrametric trees from similarity data
  • On nontransitive indifference





This page was built for publication: A graph theoretic approach to similarity relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2395596)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2395596&oldid=15033671"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 2 February 2024, at 19:36. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki