Advertisement

Applications of Combinatorics and Graph Theory to the Biological and Social Sciences: Seven Fundamental Ideas

  • Fred S. Roberts
Part of the The IMA Volumes in Mathematics and Its Applications book series (IMA, volume 17)

Abstract

To set the stage for the other papers in this volume, seven fundamental concepts which arise in the applications of combinatorics and graph theory in the biological and social sciences are described. These ideas are: RNA chains as “words” in a 4 letter alphabet; interval graphs; competition graphs or niche overlap graphs; qualitative stability; balanced signed graphs; social welfare functions; and semiorders. For each idea, some basic results are presented, some recent results are given, and some open problems are mentioned.

Keywords

Social Choice Social Welfare Function Intersection Graph Interval Graph Borda Count 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Aczél, J., Determining Merged Relative Scores, mimeographed, Centre for Information Theory and Quantitative Economics, University of Waterloo, Waterloo, Ontario (December 1988).Google Scholar
  2. [2]
    Aczél, J., and Roberts, F.S., On the Possible Merging Functions, Math. Soc. Sci. (1989); in press.Google Scholar
  3. [3]
    Aczél, J., Roberts, F.S., and Rosenbaum, Z., On Scientific Laws without Dimensional Constants, J. Math. Anal. & Appl., 119 (1986), pp. 389–416.MATHMathSciNetCrossRefGoogle Scholar
  4. [4]
    Alexander, J.C., Giesen, B., Munch, R., and Smelser, N.J. (eds.), The Micro-Macro Link, University of California Press, Berkeley, 1987.Google Scholar
  5. [5]
    Arabie, P., Boorman, S.A., and Levitt, P.R., Constructing Blockmodels: How and Why, J. Math. Psychol., 17 (1978), pp. 21–63.MATHCrossRefGoogle Scholar
  6. [6]
    Armstrong, W.E., The Determinateness of the Utility Function, Econ. J., 49 (1939), pp. 453–467.CrossRefGoogle Scholar
  7. [7]
    Arratia, R., and Lander, E.S., The Distribution of Clusters in Random Graphs, Adv. Appl. Math. (1989); in press.Google Scholar
  8. [8]
    Arrow, K., Social Choice and Individual Values, Cowles Commission Monograph 12, Wiley, New York, 1951.MATHGoogle Scholar
  9. [9]
    Barthelemy, J.P., Social Welfare and Aggregation Procedures: Combinatorial and Algorithmic Aspects, in F.S. Roberts (ed.), Applications of Combinatorics and Graph Theory in the Biological and Social Sciences, IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 1989.Google Scholar
  10. [10]
    Barthelemy, J.P., Flament, C., and Monjardet, B., Ordered Sets and Social Sciences, in I. Rival (ed.),Ordered Sets, D. Reidel, Dordrecht, 1982, pp. 721–758.Google Scholar
  11. [11]
    Barthelemy, J.P., and Janowitz, M.F., A General Setting for Consensus and the Median Procedure, mimeographed, Departement Informatique, Ecole Nationale Superieure des Telecommunications, Paris (1987).Google Scholar
  12. [12]
    Barthelemy, J.P., and Monjardet, B., The Median Procedure in Cluster Analysis and Social Choice Theory, Math. Soc. Sci., 1 (1981), pp. 235–268.MATHMathSciNetCrossRefGoogle Scholar
  13. [13]
    Barthelemy, J.P., and Monjardet, B., The Median Procedure in Data Analysis: New Results and Open Problems, in H.H. Bock (ed.),Classification and Related Methods of Data Analysis, North Holland, 1988.Google Scholar
  14. [14]
    Bartholdi, J.J. III, Tovey, C.A., and Trick, M.A., How Hard is it to Cheat in an Election?, mimeographed, Institute for Mathematics and its Applications, University of Minnesota, Minneapolis (1987); (A).Google Scholar
  15. [15]
    Bartholdi, J.J. III, Tovey, C.A., and Trick, M.A., The Computational Difficulty of Manipulating an Election, mimeographed, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta (1987); to appear in Social Choice and Welfare; (B).Google Scholar
  16. [16]
    Bartholdi, J.J. III, Tovey, C.A., and Trick, M.A., Voting Schemes for Which it can be Difficult to Tell who Won the Election, mimeographed, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta (1987); To appear in Social Choice and Welfare; (C).Google Scholar
  17. [17]
    Bassett, L, Maybee, J., and Quirk, J., Qualitative Economics and the Scope of the Correspondence Principle, Econometrica, 36 (1968), pp. 544–563.MATHMathSciNetCrossRefGoogle Scholar
  18. [18]
    Batchelder, W.H., Inferring Meaningful Global Network Properties from Individual Actors’ Measurement Scales, in L.C. Freeman, A.K. Romney, and D.R. White (eds.), Methods in Social Networks Analysis, George Mason University Press, Fairfax, VA, 1988.Google Scholar
  19. [19]
    Benzer, S., On the Topology of the Genetic Fine Structure, Proc. Nat. Acad. Sci. USA, 45 (1959), pp. 1607–1620.CrossRefGoogle Scholar
  20. [20]
    Benzer, S., The Fine Structure of the Gene, Sci. Amer., 206 (1962), pp. 70–84.Google Scholar
  21. [21]
    Bone, T., Jeffries, C., and Klee, V., A Qualitative Analysis ofẋ = Ax + b, Discrete Appl. Math., 20 (1988), pp. 9–30.MATHMathSciNetCrossRefGoogle Scholar
  22. [22]
    Booth, K.S., and Lueker, G.S., Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-tree Algorithms, J. Comput. Syst. Sci., 13 (1976), pp. 335–379.MATHMathSciNetCrossRefGoogle Scholar
  23. [23]
    Bowser, S., and Cable, C.A., Some Recent Results on Niche Graphs, mimeographed, Allegheny College, Meadville, PA (November 1988).Google Scholar
  24. [24]
    Breiger, R.L., Boorman, S.A., and Arabie, P., An Algorithm for Clustering Relational Data, with Applications to Social Network Analysis and Comparison with Multidimensional Scaling, J. Math. Psychol., 12 (1975), pp. 328–383.CrossRefGoogle Scholar
  25. [25]
    Briand, F., and Cohen, J.E., Community Food Webs have Scale-invariant Structure, Nature, Lond., 307 (1984), pp. 264–266.CrossRefGoogle Scholar
  26. [26]
    Cable, C., Jones, K., Lundgren, J.R., and Seager, S., Niche Graphs, mimeographed, Department of Mathematics, University of Colorado, Denver, Colorado (1987); to appear in Discr. Appl. Math.Google Scholar
  27. [27]
    Cartwright, D., and Harary, F., Structural Balance: A Generalization of Heider’s Theory, Psych. Rev., 63 (1956), pp. 277–293.CrossRefGoogle Scholar
  28. [28]
    Cohen, J.E., Interval Graphs and Food Webs: A Finding and a Problem, RAND Corporation Document 17696-PR, Santa Monica, CA (1968).Google Scholar
  29. [29]
    Cohen, J.E., Food Webs and Niche Space, Princeton University Press, Princeton, N.J., 1978.Google Scholar
  30. [30]
    Cohen, J.E., The Asymptotic Probability that a Random Graph is a Unit Interval Graph, Indifference Graph, or Proper Interval Graph, Discrete Math., 40 (1982), pp. 21–24.MATHMathSciNetCrossRefGoogle Scholar
  31. [31]
    Cohen, J.E., and Briand, F., Trophic Links of Community Food Webs, Proc. Nat. Acad. Sci. USA, 81 (1984), pp. 4105–4109.MATHCrossRefGoogle Scholar
  32. [32]
    Cohen, J.E., Briand, F., and Newman, C.M., A Stochastic Theory of Community Food Webs III. Predicted and Observed Lengths of Food Chains, Proc. R. Soc. Lond., B 228 (1986), pp. 317–353.CrossRefGoogle Scholar
  33. [33]
    Cohen, J.E., Komlos, J., and Mueller, T., The Probability of an Interval Graph, and Why it Matters, in D.K. Ray-Chaudhuri (ed.), Proc. Symp. on Relations between Combinatorics and other Parts of Mathematics, Amer. Math. Soc., Providence, RI, 1979.Google Scholar
  34. [34]
    Cohen, J.E., and Newman, C.M., A Stochastic Theory of Community Food Webs I. Models and Aggregated Data, Proc. R. Soc. Lond., B 224 (1985), pp. 421–448.CrossRefGoogle Scholar
  35. [35]
    Cohen, J.E., Newman, C.M., and Briand, F., A Stochastic Theory of Community Food Webs II. Individual Webs, Proc. R. Soc. Lond., B 224 (1985), pp. 449–461.CrossRefGoogle Scholar
  36. [36]
    Coleman, J.S., Microfoundations and Macrosocial Theory, in S. Lindenberg, J.S. Coleman, and S. Nowak (eds.), Approaches to Social Theory, Russell Sage Foundation, New York, 1986, pp. 345–363.Google Scholar
  37. [37]
    Cozzens, M.B., Higher and Multi-dimensional Analogues of Interval Graphs, Ph.D. Thesis, Department of Mathematics, Rutgers University, New Brunswick, N.J. (1981).Google Scholar
  38. [38]
    Cozzens, M.B., and Mahadev, N.V.R., Consecutive One’s Properties for Matrices and Graphs Including Variable Diagonal Entries, in F.S. Roberts (ed.), Applications of Combinatorics and Graph Theory in the Biological and Social Sciences, IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 1989.Google Scholar
  39. [39]
    Cozzens, M.B., and Roberts, F.S., Double Semiorders and Double Indifference Graphs, SIAM J. Alg. & Discr. Meth., 3 (1982), pp. 566–583; (A).MATHMathSciNetCrossRefGoogle Scholar
  40. [40]
    Cozzens, M.B., and Roberts, F.S., T-Colorings of Graphs and the Channel Assignment Problem, Congressus Numerantium, 35 (1982), pp. 191–208; (B).MathSciNetGoogle Scholar
  41. [41]
    Cozzens, M.B., and Roberts, F.S., Computing the Boxicity of a Graph by Covering its Complement by Cointerval Graphs, Discr. Appl. Math., 6 (1983), pp. 217–228.MATHMathSciNetCrossRefGoogle Scholar
  42. [42]
    Cozzens, M.B., and Roberts, F.S., On k-suitable Sets of Arrangements and the Boxicity of a Graph, J. Comb., Info. & Syst. Sci., 9 (1984), pp. 14–24.MATHMathSciNetGoogle Scholar
  43. [43]
    Crama, Y., Recognition and Solution of Structured Discrete Optimization Problems, Ph.D. Thesis, Rutgers Center for Operations Research, Rutgers University, New Brunswick, N.J. (1987).Google Scholar
  44. [44]
    Debreu, G., Topological Methods in Cardinal Utility Theory, in K.J. Arrow, S. Karlin, and P. Suppes (eds.), Mathematical Methods in the Social Sciences, Stanford University Press, Stanford, CA. 1960, pp. 16–26.Google Scholar
  45. [45]
    DeLisi, C., Computers in Molecular Biology: Current Applications and Emerging Trends, Science, 240 (1988), pp. 47–52.CrossRefGoogle Scholar
  46. [46]
    Doignon, J-P., Threshold Representations of Multiple Semiorders, SIAM J. Alg. & Discr. Meth., 8 (1987), pp. 77–84.MATHMathSciNetCrossRefGoogle Scholar
  47. [47]
    Dutton, R.D., and Brigham, R.C., A Characterization of Competition Graphs, Discr. Appl. Math., 6 (1983), pp. 315–317.MATHMathSciNetCrossRefGoogle Scholar
  48. [48]
    Falmagne, J-C., Probabilistic Knowledge Spaces: A Review, in F.S. Roberts (ed.), Applications of Combinatorics and Graph Theory in the Biological and Social Sciences, IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 1989.Google Scholar
  49. [49]
    Fishburn, P.C., Intransitive Indifference with Unequal Indifference Intervals, J. Math. Psychol., 7 (1970), pp. 144–149.MATHMathSciNetCrossRefGoogle Scholar
  50. [50]
    Fishburn, P.C., The Theory of Social Choice, Princeton University Press, Princeton, NJ, 1972.Google Scholar
  51. [51]
    Fishburn, P.C., On the Sphericity and Cubicity of Graphs, J. Comb. Theory, B35 (1983), pp. 309–318.MathSciNetGoogle Scholar
  52. [52]
    Fishburn, P.C., Interval Graphs and Interval Orders, Wiley, New York, 1985.MATHGoogle Scholar
  53. [53]
    Fishburn, P.C., and Roberts, F.S., Unique Finite Conjoint Measurement, Math. Soc. Sci., 16 (1988), pp. 107–143.MATHMathSciNetCrossRefGoogle Scholar
  54. [54]
    Fishburn, P.C., and Roberts, F.S., Uniqueness in Finite Measurement, in F.S. Roberts (ed.), Applications of Combinatorics and Graph Theory in the Biological and Social Sciences, IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 1989.Google Scholar
  55. [55]
    Fulkerson, D.R., and Gross, O.A., Incidence Matrices and Interval Graphs, Pacific J. Math., 15 (1965), pp. 835–855.MATHMathSciNetGoogle Scholar
  56. [56]
    Ganter, B., and Wille, R., Conceptual Scaling, in F.S. Roberts (ed.), Applications of Combinatorics and Graph Theory in the Biological and Social Sciences, IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 1989.Google Scholar
  57. [57]
    Gardenfors, P., Manipulation of Social Choice Functions, J. Econ. Theory, 13 (1976), pp. 217–228.MathSciNetCrossRefGoogle Scholar
  58. [58]
    Gibbard, A., Manipulation of Voting Schemes, Econometrica, 41 (1973), pp. 587–601.MATHMathSciNetCrossRefGoogle Scholar
  59. [59]
    Gilmore, P.C., and Hoffman, A.J., A Characterization of Comparability Graphs and of Interval Graphs, Canad. J. Math., 16 (1964), pp. 539–548.MATHMathSciNetCrossRefGoogle Scholar
  60. [60]
    Goldstein, L., and Waterman, M.S., Mapping DNA by Stochastic Relaxation, Adv. Appl. Math., 8 (1987), pp. 194–207.MATHMathSciNetCrossRefGoogle Scholar
  61. [61]
    Golumbic, M.C., Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.MATHGoogle Scholar
  62. [62]
    Gottinger, H.W., Choice and Complexity, Math. Soc. Sci., 14 (1987), pp. 1–17.MATHMathSciNetCrossRefGoogle Scholar
  63. [63]
    Greenberg, H.J., Lundgren, J.R., and Maybee, J.S., Graph-Theoretic Foundations of Computer-Assisted Analysis, in H.J. Greenberg and J.S. Maybee (eds.), Computer-Assisted Analysis and Model Simplißcation, Academic Press, New York, 1981.Google Scholar
  64. [64]
    Greenberg, H.J., Lundgren, J.R., and Maybee, J.S., Rectangular Matrices and Signed Graphs, SIAM J. Alg. & Discr. Meth., 4 (1983), pp. 50–61.MATHMathSciNetCrossRefGoogle Scholar
  65. [65]
    Greenberg, H.J., Lundgren, J.R., and Maybee, J.S., Inverting Graphs of Rectangular Matrices, Discr. Appl. Math., 8 (1984), pp. 255–265; (A).MATHMathSciNetCrossRefGoogle Scholar
  66. [66]
    Greenberg, H.J., Lundgren, J.R., and Maybee, J.S., Inverting Signed Graphs, SIAM J. Alg. & Discr. Meth., 5 (1984), pp. 216–223; (B).MATHMathSciNetCrossRefGoogle Scholar
  67. [67]
    Gyarfas, A., and Lehel, J., On-line and First Fit Colorings of Graphs, mimeographed, Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, Hungary (1987).Google Scholar
  68. [68]
    Hajos, G., Uber eine Art von Graphen, Internat. Math. Nachr., 47 (1957), p. 65.Google Scholar
  69. [69]
    Hale, W.K., Frequency Assignment: Theory and Applications, Proc. IEEE, 68 (1980), pp. 1497–1514.CrossRefGoogle Scholar
  70. [70]
    Hansen, P., Labelling Algorithms for Balance in Signed Graphs, in J-C. Bermond, et al. (eds.), Problemes Combinatoires et Theorie des Graphes, Editions du CNRS, Paris, 1978, pp. 215–217.Google Scholar
  71. [71]
    Hansen, P., Recognizing Signsolvable Graphs, Discr. Appl. Math., 6 (1983), pp. 237–241.MATHCrossRefGoogle Scholar
  72. [72]
    Hansen, P., and Simeone, B., Unimodular Functions, Discrete Appl. Math., 14 (1986), pp. 269–281.MATHMathSciNetCrossRefGoogle Scholar
  73. [73]
    Harary, F., On the Notion of Balance of a Signed Graph, Michigan Math. J., 2 (1954), pp. 143–146.MATHGoogle Scholar
  74. [74]
    Harary, F., and Kabell, J., A Simple Algorithm to Detect Balance in Signed Graphs, Math. Soc. Sci., 1 (1980), pp. 131–136.MATHMathSciNetCrossRefGoogle Scholar
  75. [75]
    Harary, F., Kim, S., and Roberts, F.S., Extremal Competition Numbers as a Generalization of Turan’s Theorem, mimeographed, Department of Mathematics, Rutgers University, New Brunswick, NJ (1989).Google Scholar
  76. [76]
    Harrison, J.L., The Distribution of Feeding Habits among Animals in a Tropical Rain Forest, J. Animal Ecology, 31 (1962), pp. 53–63.CrossRefGoogle Scholar
  77. [77]
    Havel, T.F., The Combinatorial Distance Geometry Approach to the Calculation of Molecular Conformation, Congressus Numerantium, 35 (1982), pp. 361–371.Google Scholar
  78. [78]
    Havel, T.F., Kuntz, I.D., and Crippen, G.M., The Combinatorial Distance Geometry Approach to the Calculation of Molecular Conformation I. A New Approach to an Old Problem, J. Theor. Biol., 104 (1983), pp. 359–381.CrossRefGoogle Scholar
  79. [79]
    Havel, T.F., Kuntz, I.D., Crippen, GM., and Blaney, J.M., The Combinatorial Distance Geometry Approach to the Calculation of Molecular Conformation II. Sample Problems and Computational Statistics, J. Theor. Biol., 104 (1983), pp. 383–400.CrossRefGoogle Scholar
  80. [80]
    Hefner, K., Jones, K., Kim, S., Lundgren, J.R., and Roberts, F.S., i, j Competition Graphs, RUTCOR Research Rep. RRR, # 14–88 Rutgers Center for Operations Research, Rutgers University, New Brunswick, NJ, March 1988.Google Scholar
  81. [81]
    Heider, F., Attitudes and Cognitive Organization, J. Psychology, 21 (1946), pp. 107–112.CrossRefGoogle Scholar
  82. [82]
    Hicks, J., Value and Capital, Oxford University Press, Oxford, 1939.Google Scholar
  83. [83]
    Holley, R.W., Everett, G.A., Madison, J.T., Marquisee, M., and Zamir, A., Structure of a Ribonucleic Acid, Science, 147 (1965), pp. 1462–1465.CrossRefGoogle Scholar
  84. [84]
    Hubbell, C.H., Johnsen, E.C., and Marcus, M., Structural Balance in Group Networks, in B. Anderson and R.B. Smith (eds.), Handbook of Social Science Methods, Irvington Publishers, distributed by Halsted Press, New York, 1978.Google Scholar
  85. [85]
    Hutchinson, G., Evaluation of Polymer Sequence Fragment Data using Graph Theory, Bull. Math. Biophys., 31 (1969), pp. 541–562.CrossRefGoogle Scholar
  86. [86]
    Jeffries, C., Qualitative Stability and Digraphs in Model Ecosystems, Ecology, 55 (1974), pp. 1415–1419.CrossRefGoogle Scholar
  87. [87]
    Jeffries, C., Klee, V., and van den Driessche, P., When is a Matrix Sign Stable?, Canad. J. Math., 29 (1977), pp. 315–326.MATHMathSciNetCrossRefGoogle Scholar
  88. [88]
    Jeffries, C., Klee, V., and van den Driessche, P., Qualitative Stability of Linear Systems, Linear Alg. & Appl., 87 (1987), pp. 1–48.MATHCrossRefGoogle Scholar
  89. [89]
    Johnsen, E.C., Network Macrostructure Models for the Davis-Leinhardt Set of Empirical Sociomatrices, Social Networks, 7 (1985), pp. 203–224.MathSciNetCrossRefGoogle Scholar
  90. [90]
    Johnsen, E.G. Structure and Process: Agreement Models for Friendship Formation, Social Networks, 8 (1986), pp. 257–306.MathSciNetCrossRefGoogle Scholar
  91. [91]
    Johnsen, E.C., The Micro-Macro Connection: Exact Structure and Process, in F.S. Roberts (ed.), Applications of Combinatorics and Graph Theory in the Biological and Social Sciences, IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 1989.Google Scholar
  92. [92]
    Jones, K., Lundgren, J.R., Roberts, F.S., and Seager, S., Some Remarks on the Double Competition Number of a Graph, Congr. Numerantium, 60 (1987), pp. 17–24.MathSciNetGoogle Scholar
  93. [93]
    Justicz, J., Scheinerman, E.R., and Winkler, P.M., Random Intervals, mimeographed, Department of Mathematics and Computer Science, Emory University, Atlanta, GA (1989).Google Scholar
  94. [94]
    Kambayashi, Y., Proceedings of the Conference on Consecutive Retrieval Property, Institute of Computer Science, Polish Academy of Sciences, Warsaw, Reports 438 and 439, July 1981.Google Scholar
  95. [95]
    Kelly, J.S., Social Choice and Computational Complexity, mimeographed, Syracuse University, Syracuse, NY (1987).Google Scholar
  96. [96]
    Kemeny, J.G., Mathematics without Numbers, Daedalus, 88 (1959), pp. 575–591.Google Scholar
  97. [97]
    Kemeny, J.G., and Snell, J.L., Mathematical Models in the Social Sciences, Blaisdell, New York, 1962; (Reprinted by MIT Press, Cambridge, MA, 1972.).MATHGoogle Scholar
  98. [98]
    Kierstead, H.A., and Trotter, W.T., An Extremal Problem in Recursive Combinatorics, Congr. Numerantium, 33 (1981), pp. 143–153.MathSciNetGoogle Scholar
  99. [99]
    Kim, S., McKee, T., McMorris, F.R., and Roberts, F.S., p-Competition Graphs, mimeographed, Department of Mathematics, Rutgers University, New Brunswick, NJ, 1989.Google Scholar
  100. [100]
    Kim, S., and Roberts, F.S., On Opsut’s Conjecture about the Competition Number, mimeographed, Department of Mathematics, Rutgers University, New Brunswick, NJ, 1989.Google Scholar
  101. [101]
    Kim, S., Roberts, F.S., and Seager, S., On 101-clear (0,1) Matrices and the Double Competition Number of Bipartite Graphs, mimeographed, Department of Mathematics, Rutgers University, New Brunswick, NJ (1989).Google Scholar
  102. [102]
    Klee, V., Recursive Structure of S*-Matrices, and an O(m 2 ) Algorithm for Recognizing Strong Sign-Solvability, mimeographed, Department of Mathematics, University of Washington, Seattle, (1987); to appear, Linear Alg. & Appl.Google Scholar
  103. [103]
    Klee, V., Sign-patterns and Stability, in F.S. Roberts (ed.), Applications of Combinatorics and Graph Theory in the Biological and Social Sciences, IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 1989.Google Scholar
  104. [104]
    Klee, V., Ladner, R., and Manber, R., Signsolvability Revisited, Lin. Alg. & Appl., 59 (1984), pp. 131–157.MATHMathSciNetCrossRefGoogle Scholar
  105. [105]
    Krantz, D.H., Luce, R.D., Suppes, P., and Tversky, A., Foundations of Measurement, Vol. I, Academic Press, New York, 1971.Google Scholar
  106. [106]
    Lander, E.S., and Waterman, M., Genomic Mapping by Fingerprinting Random Clones: A Mathematical Analysis, Genomics, 2 (1988), pp. 231–239.CrossRefGoogle Scholar
  107. [107]
    Lekkerkerker, C.B., and Boland, J. Ch., Representation of a Finite Graph by a Set of Intervals on the Real Line, Fund. Math., 51 (1962), pp. 45–64.MATHMathSciNetGoogle Scholar
  108. [108]
    Luce, R.D., Semiorders and a Theory of Utility Discrimination, Econometrica, 24 (1956), pp. 178–191.MATHMathSciNetCrossRefGoogle Scholar
  109. [109]
    Luce, R.D., Krantz, D.H., Suppes, P., and Tversky, A., Foundations of Measurement Vol. III, Academic Press, New York, 1989.Google Scholar
  110. [110]
    Luce, R.D., and Tukey, J.W., Simultaneous Conjoint Measurement: A New Type of Fundamental Measurement, J. Math. Psychol., 1 (1964), pp. 1–27.MATHCrossRefGoogle Scholar
  111. [111]
    Lundgren, J.R., Food Webs, Competition Graphs, Competition-Common Enemy Graphs, and Niche Graphs, in F.S. Roberts (ed.), Applications of Combinatorics and Graph Theory in the Biological and Social Sciences, IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 1989.Google Scholar
  112. [112]
    Lundgren, J.R., and Maybee, J.S., A Characterization of Graphs with Competition Number m, Discr. Appl. Math., 6 (1983), pp. 319–322.MATHMathSciNetCrossRefGoogle Scholar
  113. [113]
    Lundgren, J.R., and Maybee, J.S., Food Webs with Interval Competition Graphs, in Graphs and Applications: Proceedings of the First Colorado Symposium on Graph Theory, Wiley, New York, 1984, pp. 231–244.Google Scholar
  114. [114]
    Maehara, H., A Digraph Represented by a Family of Boxes or Spheres, J. Graph Theory, 8 (1984), pp. 431–440; (A).MATHMathSciNetCrossRefGoogle Scholar
  115. [115]
    Maehara, H., Space Graphs and Sphericity, Discr. Appl. Math., 7 (1984), pp. 55–64; (B).MATHMathSciNetCrossRefGoogle Scholar
  116. [116]
    Maehara, H., Sphericity Exceeds Cubicity for Almost all Complete Bipartite Graphs, J. Comb. Theory, B40 (1986), pp. 231–235.MathSciNetGoogle Scholar
  117. [117]
    Manber, R., Graph-theoretical Approach to Qualitative Stability of Linear Systems, Lin. Alg. Appl., 48 (1982), pp. 457–470.MATHMathSciNetCrossRefGoogle Scholar
  118. [118]
    Marcotorchino, P., and Michaud, P., Heuristic Approach of the Similarity Aggregation Problem, Methods of Oper. Res., 43 (1981), pp. 395–404.MATHGoogle Scholar
  119. [119]
    Marczewski, E., Sur deux Proprietes des Classes d’ensembles, Fund. Math., 33 (1945), pp. 303–307.MATHMathSciNetGoogle Scholar
  120. [120]
    Maybee, J.S., Sign Solvability, in H. Greenberg and J. Maybee (eds.), Computer-Assisted Analysis and Model Simplification, Academic Press, New York, 1981, pp. 201–257.Google Scholar
  121. [121]
    Maybee, J.S., Qualitatively Stable Matrices and Convergent Matrices, in F.S. Roberts (ed.), Applications of Combinatorics and Graph Theory in the Biological and Social Sciences, IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 1989.Google Scholar
  122. [122]
    Maybee, J.S., and Maybee, S.J., An Algorithm for Identifying Morishima and Anti-Morishima Matrices and Balanced Digraphs, Math. Soc. Sci., 6 (1983), pp. 99–103.MATHMathSciNetCrossRefGoogle Scholar
  123. [123]
    Maybee, J.S., and Quirk, J., The GM-matrix Problem, Tech. Rep., Dept. of Computer Sci., Univ. of Colorado, Boulder (1973).Google Scholar
  124. [124]
    Maybee, J.S., and Richman, D.J., Some Properties of GM-matrices and their Inverses, Lin. Alg. Appl. (1989) (to appear).Google Scholar
  125. [125]
    Maybee, J.S., and Wiener, G.M., From Qualitative Matrices to Quantitative Restrictions, Linear and Multilinear Alg., 22 (1987).Google Scholar
  126. [126]
    Mckelvey, R., Intransitivities in Multidimensional Voting Models and Some Implications for Agenda Control, J. Econ. Th., 12 (1976), pp. 472–482.MATHMathSciNetCrossRefGoogle Scholar
  127. [127]
    McMorris, F.R., Axioms for Consensus Functions on Undirected Phylogenetic Trees, Math. Biosciences, 74 (1985), pp. 17–21.MATHMathSciNetCrossRefGoogle Scholar
  128. [128]
    Menger, K., Probabilistic Theories of Relations, Proc. Nat. Acad. Sci., 37 (1951), pp. 178–180.MathSciNetCrossRefGoogle Scholar
  129. [129]
    Michaud, P., and Marcotorchino, P., Modeles d’Optimisation en Analyse des Donnees Relationnelles, Math. Sci. Hum., 67 (1979), pp. 7–38.MATHGoogle Scholar
  130. [130]
    Morishima, M., On the Laws of Change of the Price System in an Economy which Contains Complementary Commodities, Osaka Economic Papers, 1 (1952), pp. 101–113.Google Scholar
  131. [131]
    Mosimann, J., Elementary Probability for the Biological Sciences, Appleton-Century-Crofts, New York, 1968.Google Scholar
  132. [132]
    Narens, L., Abstract Measurement Theory, MIT Press, Cambridge, MA, 1985.MATHGoogle Scholar
  133. [133]
    Newman, C.M., and Cohen, J.E., A Stochastic Theory of Community Food Webs IV. Theory of Food Chain Lengths in Large Webs, Proc. R. Soc. Lond., B 228 (1986), pp. 355–377.CrossRefGoogle Scholar
  134. [134]
    Opsut, R.J., On the Computation of the Competition Number of a Graph, SIAM J. Alg. & Discr. Meth., 3 (1982), pp. 420–428.MATHMathSciNetCrossRefGoogle Scholar
  135. [135]
    Opsut, R.J., and Roberts, F.S., On the Fleet Maintenance, Mobile Radio Frequency, Task Assignment, and Traffic Phasing Problems, in G. Chartrand, Y. Alavi, D.L. Goldsmith, L. Lesniak-Foster, and D.R. Lick (eds.), The Theory and Applications of Graphs, Wiley, New York, 1981, pp. 479–492.Google Scholar
  136. [136]
    Opsut, R.J., and Roberts, F.S., I-Colorings, I-Phasings, and I-Intersection Assignments for Graphs, and their Applications, Networks, 13 (1983), pp. 327–345; (A).MATHMathSciNetCrossRefGoogle Scholar
  137. [137]
    Opsut, R.J., and Roberts, F.S., Optimal I-Intersection Assignments for Graphs: A Linear Programming Approach, Networks, 13 (1983).Google Scholar
  138. [138]
    Owen, G. and Shapley, L., The Copeland Winner and the Shapley Value in Spatial Voting Games, Int. J. Game Theory (1989) (to appear).Google Scholar
  139. [139]
    Percus, J.K., Tree Structures in Immunology, in F.S. Roberts (ed.), Applications of Combinatorics and Graph Theory in the Biological and Social Sciences, IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 1989.Google Scholar
  140. [140]
    Pfanzagl, J., Theory of Measurement, Wiley, New York, 1968.MATHGoogle Scholar
  141. [141]
    Pieper, G.W., Computer Scientists Join Biologists in Genome Project, SIAM News, January 1989, p. 18.Google Scholar
  142. [142]
    Quirk, J., A Class of Generalized Metzlerian Matrices, in G. Horwich and P. Samuelson (eds.), Trade, Stability, and Macroeconomics: Essays in Honor of Lloyd A. Metzler, Academic Press, New York, 1974.Google Scholar
  143. [143]
    Quirk, J., Qualitative Stability of Matrices and Economic Theory: A Survey Article, in H. Greenberg and J. Maybee (eds.), Computer-Assisted Analysis and Model Simplification, Academic Press, New York, 1981, pp. 113–164.Google Scholar
  144. [144]
    Quirk, J., and Ruppert, R., Qualitative Economics and the Stability of Equilibrium, Rev., Economic Studies, 32 (1965), pp. 311–326.CrossRefGoogle Scholar
  145. [145]
    Raychaudhuri, A., Intersection Assignments, T-Coloring, and Powers of Graphs, Ph.D. Thesis, Department of Mathematics, Rutgers University, New Brunswick, NJ (1985).Google Scholar
  146. [146]
    Raychaudhuri, A., and Roberts, F.S., Generalized Competition Graphs and their Applications, in P. Brucker and R. Pauly (eds.), Methods of Operations Research, Vol. 49, Anton Hain, Konigstein, W. Germany, 1985, pp. 295–311.Google Scholar
  147. [147a]
    Regnier, S., Sur Quelques Aspects Mathematiques de la Classification Automatique, ICC Bull., 4 (1965), pp. 175–191;Google Scholar
  148. [147b]
    reprinted, Regnier, S., Sur Quelques Aspects Mathematiques de la Classification Automatique, Math. et Sciences Humaines, 82 (1983), 21–30.MathSciNetGoogle Scholar
  149. [148]
    Roberts, F.S., Indifference Graphs, in in F. Harary (ed.), Proof Techniques in Graph Theory, Academic Press, New York, 1969, pp. 139–146; (A).Google Scholar
  150. [149]
    F.S. Roberts, On the Boxicity and Cubicity of a Graph, in W.T. Tutte (ed.), Recent Progress in Combinatorics, Academic Press, New York, 1969, pp. 301–310; (B).Google Scholar
  151. [150]
    F.S. Roberts, Discrete Mathematical Models, with Applications to Social, Biological, and Environmental Problems, Prentice-Hall, Englewood Cliffs, N.J, 1976.MATHGoogle Scholar
  152. [151]
    F.S. Roberts, Food Webs, Competition Graphs, and the Boxicity of Ecological Phase Space, in Y. Alavi and D. Lick (eds.), Theory and Applications of Graphs, Springer-Verlag, New York, 1978, pp. 477–490; (A).CrossRefGoogle Scholar
  153. [152]
    F.S. Roberts, Graph Theory and its Applications to Problems of Society, CBMS-NSF Monograph No. 29, SIAM, Philadelphia (1978); (B).CrossRefGoogle Scholar
  154. [153]
    F.S. Roberts, Graph Theory and the Social Sciences, in R.J. Wilson and L.W. Beinecke (eds.), Applications of Graph Theory, Academic Press, London, 1979; (A).Google Scholar
  155. [154]
    F.S. Roberts, Measurement Theory, with Applications to Decisionmaking, Utility, and the Social Sciences, Addison Wesley, Reading, MA, 1979; (B).MATHGoogle Scholar
  156. [155]
    F.S. Roberts, Applications of the Theory of Meaningfulness to Order and Matching Experiments, in E. DeGreef and J. Van Buggenhaut (eds.), Trends in Mathematical Psychology, North-Holland, Amsterdam, 1984, pp. 283–292; (A).CrossRefGoogle Scholar
  157. [156]
    F.S. Roberts, Applied Combinatorics, Prentice-Hall, Englewood Cliffs, N.J., 1984; (B).MATHGoogle Scholar
  158. [157]
    F.S. Roberts, Applications of the Theory of Meaningfulness to Psychology, J. Math. Psychol., 29 (1985), pp. 311–332.MATHCrossRefGoogle Scholar
  159. [158]
    F.S. Roberts, T-Colorings of Graphs: Recent Results and Open Problems, RUTCOR Research Report RRR #7–86, Rutgers Center for Operations Research, Rutgers University, New Brunswick, N.J., May 1986; To appear in Annals of Discr. Math.Google Scholar
  160. [159]
    F.S. Roberts, From Garbage to Rainbows: Generalizations of Graph Coloring and their Applications, in Y. Alavi, G. Chartrand, O.R. Oellermann, and A.J. Schwenk (eds.), Proceedings of the Sixth International Conference on the Theory and Applications of Graphs, Wiley, New York, to appear, 1989; (A).Google Scholar
  161. [160]
    Roberts, F.S., Meaningless Statements, Matching Experiments, and Colored Digraphs (Applications of Graph Theory and Combinatorics to the Theory of Measurement), in F.S. Roberts (ed.), Applications of Combinatorics and Graph Theory in the Biological and Social Sciences, IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 1989; (B).Google Scholar
  162. [161]
    Roberts, F.S., Merging Normalized Scores, J. Math. Anal. & Appl. (1989) (to appear); (C).Google Scholar
  163. [162]
    Roberts, F.S., and Rosenbaum, Z., ScaleType, Meaningfulness, and the Possible Psychophysical Laws, Math. Soc. Sci., 12 (1986), pp. 77–95.MATHMathSciNetCrossRefGoogle Scholar
  164. [163]
    Roberts, F.S., and Steif, J.E., A Characterization of Competition Graphs of Arbitrary Digraphs, Discrete Applied Math., 6 (1983), pp. 323–326.MATHMathSciNetCrossRefGoogle Scholar
  165. [164]
    Samuelson, P., Foundations of Economic Analysis, Harvard University Press, Cambridge, MA, 1947.MATHGoogle Scholar
  166. [165]
    Satterthwaite, M.A., Strategy-proofness and Arrow’s Conditions, J. Econ. Theory, 10 (1975), pp. 187–217.MATHMathSciNetCrossRefGoogle Scholar
  167. [166]
    Scheinerman, E.R., An Evolution of Interval Graphs, mimeographed, Department of Mathematical Sciences, The Johns Hopkins University, Baltimore, MD (1987); (A).Google Scholar
  168. [167]
    Scheinerman, E.R., Random Interval Graphs, mimeographed, Department of Mathematical Sciences, The Johns Hopkins University, Baltimore, MD (1987); to appear in Combinatorica; (B).Google Scholar
  169. [168]
    Scott, D.D., The Competition-Common Enemy Graph of a Digraph, Discr. Appl. Math., 17 (1987), pp. 269–280.MATHCrossRefGoogle Scholar
  170. [169]
    Scott, D., and Suppes, P., Foundational Aspects of Theories of Measurement, J. Symb. Logic, 23 (1958), pp. 113–128.MathSciNetCrossRefGoogle Scholar
  171. [170]
    Seager, S.M., The Double Competition Number of Some Triangle-free Graphs, mimeographed, Department of Mathematics, Mount Saint Vincent University, Halifax, Nova Scotia, Canada (1988).Google Scholar
  172. [171]
    Sellers, P.H., Combinatorial Aspects of Enzyme Kinetics, in F.S. Roberts (ed.), Applications of Combinatorics and Graph Theory in the Biological and Social Sciences, IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 1989.Google Scholar
  173. [172]
    Sen, A.K., Collective Choice and Social Welfare, Holden-Day, San Francisco, 1970.MATHGoogle Scholar
  174. [173]
    Shapley, L.S., and Shubik, M., A Method for Evaluating the Distribution of Power in a Committee System, Amer. Polit. Sci. Rev., 48 (1954), pp. 787–792.CrossRefGoogle Scholar
  175. [174]
    Steif, J.E., Frame Dimension, Generalized Competition Graphs, and Forbidden Sublist Characterizations, Henry Rutgers Thesis, Department of Mathematics, Rutgers University, New Brunswick, N.J. (1982).Google Scholar
  176. [175]
    Stoffers, K.E., Scheduling of Traffic LightsA New Approach, Transp. Res., 2 (1968), pp. 199–234.CrossRefGoogle Scholar
  177. [176]
    Straffin, P.D., Jr., Spatial Models of Power and Voting Outcomes, in F.S. Roberts (ed.), Applications of Combinatorics and Graph Theory in the Biological and Social Sciences, IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 1989.Google Scholar
  178. [177]
    Sugihara, G., GraphTheory, Homology, and Food Webs, in S.A. Levin (ed.), Population Biology, Proc. Symposia in Applied Mathematics, Vol. 30, American Mathematical Society, Providence, Rhode Island, 1983.Google Scholar
  179. [178]
    Suppes, P., Krantz, D.H., Luce, R.D., and Tversky, A., Foundations of Measurement, Vol. II, Academic Press, New York, 1989.Google Scholar
  180. [179]
    Tesman, B., Ph.D. Thesis, Department of Mathematics, Rutgers University, New Brunswick, NJ (1989); in preparation.Google Scholar
  181. [180]
    Trotter, W.T., Interval Graphs, Interval Orders and their Generalizations, in R.D. Ringeisen and F.S. Roberts (eds.), Applications of Discrete Mathematics, SIAM, Philadelphia, 1988, pp. 45–58.Google Scholar
  182. [181]
    Wakabayashi, Y., Aggregation of Binary Relations: Algorithmic and Polyhedral Investigations, thesis, Augsburg (1986).Google Scholar
  183. [182]
    Waterman, M.S., Some Mathematics for DNA Restriction Mapping, in F.S. Roberts (ed.), Applications of Combinatorics and Graph Theory in the Biological and Social Sciences, IMA Volumes in Mathematics and its Applications, Springer-Verlag, New York, 1989.Google Scholar
  184. [183]
    Waterman, M.S., and Griggs, J.R., Interval Graphs and Maps of DNA, Bull. Math. Biol., 48 (1986), pp. 189–195.MATHMathSciNetGoogle Scholar
  185. [184]
    Yannakakis, M., The Complexity of the Partial Order Dimension Problem, SIAM J. Alg. & Discr. Meth., 3 (1982), pp. 351–358.MATHMathSciNetCrossRefGoogle Scholar
  186. [185]
    Young, H.P., and Levenglick, A., A Consistent Extension of the Condorcet Election Principle, SIAM J. Appl. Math., 35 (1978), pp. 285–300.MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag New York Inc. 1989

Authors and Affiliations

  • Fred S. Roberts
    • 1
  1. 1.Department of MathematicsRutgers UniversityNew BrunswickUSA

Personalised recommendations