@article{oai:niigata-u.repo.nii.ac.jp:00001938,
 author = {Sengoku, Masakazu and Shinoda, Shoji and Abe, Takeo},
 issue = {4},
 journal = {IEICE transactions on fundamentals of electronics, communications and computer sciences, IEICE transactions on fundamentals of electronics, communications and computer sciences},
 month = {Apr},
 note = {We introduce the distance between two edges in a graph (nondirected graph) as the minimum number of edges in a tieset with the two edges. Using the distance between edges we define the eccentricity ε_τ (e_j) of an edge e_j. A finite nonempty set J of positive integers (no repetitions) is an eccentric set if there exists a graph G with edge set E such that ε_τ (e_j) ∈J for all e_i ∈E and each positive integer in J is ε_τ (e_j) for some e_j ∈E.. In this paper, we give necessary and sufficient conditions for a set J to be eccentric.},
 pages = {687--691},
 title = {On Eccentric Sets of Edges in Graphs},
 volume = {E74-A},
 year = {1991}
}