Faculty Commons, A Center for Teaching, Learning, Scholarship and Service coordinates all professional development, grants and assessment activities of faculty at New York City College of Technology. Faculty Commons adopts a programmatic approach to professional development and operates as a faculty resource and think tank where members collaborate on a variety of projects to shape curriculum, pedagogy and assessment.
The Office of Sponsored Programs (OSP) helps faculty and administrators compete for and win grants that strengthen the intellectual climate and improve the learning environment at City Tech. The office provides notices of grant opportunities and works with faculty and administrators over the life-cycle of a grant – from concept development through close-out.
The Professional Activity Report and Self-Evaluation (PARSE) is the documentation of a faculty member’s accomplishments during each academic year and cumulatively, in the three principal areas of teaching, scholarly and professional growth, and service. The PARSE serves as the basis for the annual evaluation. It is also provides faculty with an instrument to present to departmental and college review committees for reappointment, tenure, and promotion.
Presented by Prof. Eugene Fiorini
Faculty and students are welcome, light refreshments will be served.
Competition graphs and graph pebbling are two examples of graph theoretical-type games played on a graph under well-defined conditions. In the case of graph pebbling, the pebbling number pi(G) of a graph G is the minimum number of pebbles necessary to guarantee that, regardless of distribution of pebbles and regardless of the target vertex, there exists a sequence of pebbling moves that results in placing a pebble on the target vertex. A class-0 graph is one in which the pebbling number is the order of the graph, pi(G)=|V(G)|. This talk will consider under what conditions the edge set of a graph G can be partitioned into k class-0 subgraphs, k a positive integer. Furthermore, suppose D is a simple digraph with vetex set V(D) and edge set E(D). The competition graph G(V(G),E(G)) of D is defined as a graph with vertex set V(G)=V(D) and edge vw in E(G) if and only if for some vertex u in V, there exist directed edges (u,v) and (u,w) in E(D). This talk will present some recent results on forbidden subgraphs of a family of competition graphs.