2024-03-28T09:35:21Z
https://niigata-u.repo.nii.ac.jp/oai
oai:niigata-u.repo.nii.ac.jp:00001937
2022-12-15T03:34:46Z
423:424:425
453:454
On Eccentric Sets of Edges in Graphs
On Eccentric Sets of Edges in Graphs
Sengoku, Masakazu
Shinoda, Shoji
Abe, Takeo
copyright©1991 IEICE
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 ετ (ej) of an edge ej. 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 ετ (ej) ∈ J for all ei ∈ E and each positive integer in J is ετ (ej) for some ej ∈ E. In this paper, we give necessary and sufficient conditions for a set J to be eccentric.
The Institute of Electronics, Information and Communication Engineers
1991-04
eng
journal article
http://hdl.handle.net/10191/6508
https://niigata-u.repo.nii.ac.jp/records/1937
http://www.ieice.org/jpn/trans_online/
AA10826239
09168508
IEICE transactions on fundamentals of electronics, communications and computer sciences
IEICE transactions on fundamentals of electronics, communications and computer sciences
E74-A
4
687
691
https://niigata-u.repo.nii.ac.jp/record/1937/files/e74-a_4_687.pdf
application/pdf
283.3 kB
2019-07-29