911709
Homeomorphs and amallamorphs of the Petersen graph
Let P be the Petersen graph. The main results of this paper are the discovery of infinite families of chromatically equivalent pairs of P homeomorphs and the discovery of infinite families of flow equivalent pairs of P amallamorphs. In particular, three families of P homeomorphs with 8 parameters, five families with 7 parameters and many families with fewer parameters are obtained. Also one family of P amallamorphs with 9 parameters, three families with 7 parameters, seven families with 6 parameters and many families with fewer parameters are obtained.
9513339
Chromatic polynomials of homeomorphism classes of graphs
Abstract We study a multilinear polynomial which subsumes the chromatic polynomials of all the graphs in a given homeomorphism class. We show that this polynomial can be extended to include further families of homeomorphic graphs, and derive some properties of its coefficients. We also prove similar results for the dual concept of graphs with multiple edges.
205877725
Chromaticity of a family of K4 homeomorphs
Abstract A K 4 homeomorph can be described as a graph on n vertices having 4 vertices of degree 3 and n − 4 vertices of degree 2; each pair of degree 3 vertices is joined by a path. We study the chromatic uniqueness and chromatic equivalence of one family of K 4 homeomorphs. This family has exactly 3 paths of length one. The results of this study leads us to solve 3 of the problems posed by Koh and Teo in their 1990 survey paper which appeared in Graphs and Combinatorics.
6916623
Chromatic polynomials of generalized trees
Abstract This paper is a survey of results on chromatic polynomials of graphs which are generalizations of trees. In particular, chromatic polynomials of q -trees will be discussed. The smallest q -tree ( q ≥1) is the complete graph K q on q vertices. A q -tree on n +1 vertices where n ≥ q , is obtained by adding a new vertex adjacent to each of q arbitrarily selected, mutually adjacent vertices in a q -tree on n vertices. Another generalization of trees is the n -gon-trees. The smallest n -gon-tree ( n ≥3) is the n -gon which is a cycle of n vertices. A n -gon-tree with k +1 n -gons is obtained from a n -gon-tree with k n -gons by adding a new n -gon which has exactly one edge in common with any n -gon of a n -gon-tree with k n -gons.
5345896
Properties of academic paper references
We propose a new method to find related papers using an input paper and its hyperlinked citation relationships rather than keywords. Such related papers are especially useful as background reading for researchers new to a research field. In this paper we introduce the background reading paper extractor (BPE), and show various properties of academic paper references.
9717322
Mining version archives for co-changed lines
Files, classes, or methods have frequently been investigated in recent research on co-change. In this paper, we present a first study at the level of lines. To identify line changes across several versions, we define the annotation graph which captures how lines evolve over time. The annotation graph provides more fine-grained software evolution information such as life cycles of each line and related changes: "Whenever a developer changed line 1 of version.txt she also changed line 25 of Library.java."
9755399
Uniform Comparison of Configuration Management Data Models
The data models of a series of 11 configuration management systems--of varying type and complexity--are represented using containment data models. Containment data models are a specialized form of entityrelationship model in which entities may be containers or atoms, and the only permitted form of relationship is inclusion or referential containment. By using entities to represent the native abstractions of each system, and containment relationships to model inclusion and identifier references, systems can be modeled uniformly, permitting consistent cross-comparison of systems.
2542573
Control choices and network effects in hypertext systems
When the utility of a hypertext system depends on the number of users and amount of data in the system, the system exhibits network effects. This paper examines how the core differences in control assumptions between monolithic hypertext systems, open hypermedia systems, and the Web, lead to different incentive structures for readers and content providers and hence varying levels of
14788283
Automatic Identification of Bug-Introducing Changes
Bug-fixes are widely used for predicting bugs or finding risky parts of software. However, a bug-fix does not contain information about the change that initially introduced a bug. Such bug-introducing changes can help identify important properties of software bugs such as correlated factors or causalities. For example, they reveal which developers or what kinds of source code changes introduce more bugs. In contrast to bug-fixes that are relatively easy to obtain, the extraction of bug-introducing changes is challenging. In this paper, we present algorithms to automatically and accurately identify bug-introducing changes. We remove false positives and false negatives by using annotation graphs, by ignoring non-semantic source code changes, and outlier fixes. Additionally, we validated that the fixes we used are true fixes by a manual inspection. Altogether, our algorithms can remove about 38%~51% of false positives and 14%~15% of false negatives compared to the previous algorithm. Finally, we show applications of bug-introducing changes that demonstrate their value for research