On Eccentric Sets of Edges in Graphs
Summary :
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)
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E74-A No.4 pp.687-691
- Publication Date
- 1991/04/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Issue on Discrete Mathematics and Its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Masakazu SENGOKU, Shoji SHINODA, Takeo ABE, "On Eccentric Sets of Edges in Graphs" in IEICE TRANSACTIONS on Fundamentals,
vol. E74-A, no. 4, pp. 687-691, April 1991, doi: .
Abstract: 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)
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e74-a_4_687/_p
Copy
@ARTICLE{e74-a_4_687,
author={Masakazu SENGOKU, Shoji SHINODA, Takeo ABE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Eccentric Sets of Edges in Graphs},
year={1991},
volume={E74-A},
number={4},
pages={687-691},
abstract={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)
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - On Eccentric Sets of Edges in Graphs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 687
EP - 691
AU - Masakazu SENGOKU
AU - Shoji SHINODA
AU - Takeo ABE
PY - 1991
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E74-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 1991
AB - 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)
ER -
English
