Convention All Academic Convention makes running your annual conference simple and cost effective. It is your online solution for abstract management, peer review, and scheduling for your annual meeting or convention. Submission - Custom fields, multiple submission types, tracks, audio visual, multiple upload formats, automatic conversion to pdf. Review - Peer Review, Bulk reviewer assignment, bulk emails, ranking, z-score statistics, and multiple worksheets! Reports - Many standard and custom reports generated while you wait. Print programs with participant indexes, event grids, and more! Scheduling - Flexible and convenient grid scheduling within rooms and buildings. Conflict checking and advanced filtering. Communication - Bulk email tools to help your administrators send reminders and responses. Use form letters, a message center, and much more! Management - Search tools, duplicate people management, editing tools, submission transfers, many tools to manage a variety of conference management headaches! Click here for more information.
Association: Name: Mathematical Association of America URL: http://www.maa.org
Citation: URL: http://www.allacademic.com/meta/p206436_index.html Direct Link: HTML Code:

Winters, Steven. "Distance Properties of Graphs" Paper presented at the annual meeting of the Mathematical Association of America, The Fairmont Hotel, San Jose, CA, Aug 03, 2007 <Not Available>. 2008-10-09 <http://www.allacademic.com/meta/p206436_index.html>

Winters, S. J. , 2007-08-03 "Distance Properties of Graphs" Paper presented at the annual meeting of the Mathematical Association of America, The Fairmont Hotel, San Jose, CA <Not Available>. 2008-10-09 from http://www.allacademic.com/meta/p206436_index.html

Publication Type: Conference Paper/Unpublished Manuscript Abstract: The distance from a vertex u to a vertex v in a connected graph G is the length of a shortest u–v path in G. The eccentricity of a vertex v in a connected graph is the distance between v and a vertex farthest from v. The center of a graph is the subgraph induced by those vertices having minimum eccentricity while the periphery is the subgraph induced by those vertices having maximum eccentricity. The distance of a vertex v in G is the sum of the distances from v to the vertices of G. The median of a graph is the subgraph induced by those vertices having minimum distance. Other distance related subgraphs will also be defined during this talk. Graph theory problems related to these subgraphs are excellent for undergraduate research projects. For example, we could consider the relative location of subgraphs or the appendage number of a subgraph. We also investigate what happens when an edge is removed from the graph at random.

Property, Citizenship, and Social Entrepreneurism: From Real to Synthetic Property

Pizza Delivery: 2-Stop-Return Distances in Graphs

The Politics of Property and the New Politics of Intellectual Property in the Developing World: Insights from Latin America