# 1/2-Transitive Graphs of Order 3p by Alspach B., Xu M.Y.

By Alspach B., Xu M.Y.

Best graph theory books

Graph Partitioning (ISTE)

Writer notice: Patrick Siarry (Editor), Charles-Edmond Bichot (Editor)
-------------------

Graph partitioning is a theoretical topic with functions in lots of components, largely: numerical research, courses mapping onto parallel architectures, snapshot segmentation, VLSI layout. over the past forty years, the literature has strongly elevated and massive advancements were made.

This ebook brings jointly the data accrued in the course of a long time to extract either theoretical foundations of graph partitioning and its major applications.

Introduction to [lambda]-trees

The speculation of Λ-trees has its starting place within the paintings of Lyndon on size features in teams. the 1st definition of an R-tree used to be given by way of titties in 1977. the significance of Λ-trees used to be proven by way of Morgan and Shalen, who confirmed how one can compactify a generalisation of Teichmüller house for a finitely generated staff utilizing R-trees.

A Course in Topological Combinatorics

A path in Topological Combinatorics is the 1st undergraduate textbook at the box of topological combinatorics, a subject matter that has turn into an energetic and leading edge study region in arithmetic during the last thirty years with becoming purposes in math, laptop technological know-how, and different utilized components.

Modern Graph Theory

The time has now come whilst graph idea can be a part of the schooling of each severe scholar of arithmetic and laptop technology, either for its personal sake and to reinforce the appreciation of arithmetic as an entire. This publication is an in-depth account of graph idea, written with this sort of scholar in brain; it displays the present country of the topic and emphasizes connections with different branches of natural arithmetic.

Additional resources for 1/2-Transitive Graphs of Order 3p

Example text

Complete Ranking. In some network designs, actors are asked to rate or rank order all the other actors in the set for each measured relation. Such measurements reflect the intensity of strength of ties. Ratings require each respondent to assign a value or rating to each tie. Complete rankings require each respondent to rank their ties to all other actors. An example of a complete rank order design is the study by Bernard, Killworth, and Sailer (1980). They asked each of forty members of a social science research office to report the amount of communication with each other member of the office using the following procedure: .

They arranged (that is, ranked) the cards from most to least on how often they talked to others in ihe office during a normal working day. (page 194) Such data are conzplete rankings or complete rank orders. This questionnaire design is quite different from that employing ratings of the ties. Alternatively, one can gather ratings from each actor about their ties to other members on every relation. These ratings can be dichotomous, as in the Carley and Wendt (1988) study (ties are either present or absent), or valued, as in the Krackhardt and Stern (1988) study where ratings were made by choosing one of five possible categories for the strength of each tie.

These data are described at the end of this chapter. Yet another example comes from Katz and Proctor's (1959) study of ties in an eighth-grade classrooln of twenty-five boys and girls. These data consist of friendship choices made four times during the school year. The data were gathered by Taba (1955), who focused on the differences and similarities between boy-boy and girl-girl choices, and "mixed gender" ties. 4 Measurement Validity, Reliability, Accuuacy, Error As we noted in Chapter 1, social network research is concerned with studying patterns of social structure.