620 research outputs found
Quantum walk-based search and centrality
We study the discrete-time quantum walk-based search for a marked vertex on a
graph. By considering various structures in which not all vertices are
equivalent, we investigate the relationship between the successful search
probability and the position of the marked vertex, in particular its
centrality. We find that the maximum value of the search probability does not
necessarily increase as the marked vertex becomes more central and we
investigate an interesting relationship between the frequency of the successful
search probability and the centrality of the marked vertex.Comment: 29 pages, 17 figure
Graphical Indices and their Applications
The biochemical community has been using graphical (topological, chemical) indices in the study of Quantitative Structure-Activity Relationships (QSAR) and Quantitative Structure-Property Relationships (QSPR), as they have been shown to have strong correlations with the chemical properties of certain chemical compounds (i.e. boiling point, surface area, etc.). We examine some of these chemical indices and closely related pure graph theoretical indices: the Randić index, the Wiener index, the degree distance, and the number of subtrees. We find which structure will maximize the Randić index of a class of graphs known as cacti, and we find a functional relationship between the Wiener index and the degree distance for several types of graphs. We also develop an algorithm to find the structure that maximizes the number of subtrees of trees, a characterization of the second maximal tree may also follow as an immediate result of this algorithm
L(2,1)-labeling of oriented planar graphs
The L(2, 1)-labeling of a digraph D is a function l from the vertex set of D to the set of all nonnegative integers such that vertical bar l(x) - l(y)vertical bar >= 2 if x and y are at distance 1, and l(x) not equal l(y) if x and y are at distance 2, where the distance from vertex x to vertex y is the length of a shortest dipath from x to y. The minimum over all the L(2, 1)-labelings of D of the maximum used label is denoted (lambda) over right arrow (D). If C is a class of digraphs, the maximum (lambda) over right arrow (D), over all D is an element of C is denoted (lambda) over right arrow (C). In this paper we study the L(2, 1)-labeling problem on oriented planar graphs providing some upper bounds on (lambda) over right arrow. Then we focus on some specific subclasses of oriented planar graphs, improving the previous general bounds. Namely, for oriented prisms we compute the exact value of (lambda) over right arrow, while for oriented Halin graphs and cacti we provide very close upper and lower bounds for (lambda) over right arrow. (c) 2012 Elsevier B.V. All rights reserved
ECONOMIC BENEFITS OF CRITICAL HABITAT FOR THE MEXICAN SPOTTED OWL: A SCOPE TEST USING A MULTIPLE-BOUNDED CONTINGENT VALUATION SURVEY
A split-sample design is used to test for a difference between mean willingness to pay (WTP) for protecting the Mexican spotted owl versus protecting 62 threatened/endangered species which includes the Mexican spotted owl. The multiple bounded contingent valuation method is used in a mail survey of U.S. residents. The mean WTP amounts are statistically different at the 0.1 confidence level indicating the multiple-bounded mail survey passes the scope test. The range of estimated benefits of preserving the 4.6 million acres of critical habitat for the Mexican spotted owl substantially outweighs the costs of the recovery effort.Environmental Economics and Policy,
- …