episode 1

Edward is white, he is the man in the picture.... thats all i know. tbh i dont even know if his name is edward. this episode needs 500 words? from now on this episode will just be something from Wikipedia.

The Providence and Worcester Railroad (P&W) is an American Class II railroad operating 612 miles (985 km) of tracks in Rhode Island, Massachusetts, Connecticut, and New York. It was formed in 1844 to connect its eponymous cities, and ran its first trains in 1847. P&W later built a branch to East Providence, Rhode Island, and double-tracked its main line after a fatal train collision. P&W remained independent until 1888, when the New York, Providence and Boston Railroad leased it; the New York, New Haven and Hartford Railroad (the New Haven) assumed the lease in 1892. P&W remained leased until the New Haven was merged into Penn Central (PC) in 1968. When PC threatened to abandon the line, P&W's shareholders convinced regulators to give them back their railroad, and P&W returned to independence in 1973 after 85 years. P&W grew from under 100 miles (161 km) by purchasing other lines, expanding more than sixfold. In 2016, P&W was purchased by railroad holding company Genesee & Wyoming.

still not enough? wow

In graph theory, a branch of mathematics, the modular graphs are undirected graphs in which every three vertices x, y, and z have at least one median vertex m(x, y, z) that belongs to shortest paths between each pair of x, y, and z.[1] Their name comes from the fact that a finite lattice is a modular lattice if and only if its Hasse diagram is a modular graph.[2]

A modular graph derived from a modular lattice

It is not possible for a modular graph to contain a cycle of odd length. For, if C is a shortest odd cycle in a graph, x is a vertex of C, and yz is the edge of C farthest from x, there could be no median m(x, y, z), for the only vertices on the shortest path yz are y and z themselves, but neither can belong to a shortest path from x to the other without shortcutting C and creating a shorter odd cycle. Therefore, every modular graph is a bipartite graph.[1]

The modular graphs contain as a special case the median graphs, in which every triple of vertices has a unique median;[1] median graphs are related to distributive lattices in the same way that modular graphs are related to modular lattices. However, the modular graphs also include other graphs such as the complete bipartite graphs where the medians are not unique: when the three vertices x, y, and z all belong to one side of the bipartition of a complete bipartite graph, every vertex on the other side is a median.[2] Every chordal bipartite graph (a class of graphs that includes the complete bipartite graphs and the bipartite distance-hereditary graphs) is modular.

finally enough

***Download NovelToon to enjoy a better reading experience!***