On heavy paths in 2-connected weighted graphs

Bin long Li; Sheng gui Zhang

doi:10.1007/s10255-017-0698-6

On heavy paths in 2-connected weighted graphs

Bin long Li, Sheng gui Zhang

School of Mathematics and Statistics

Northwestern Polytechnical University Xian

Research output: Contribution to journal › Article › peer-review

Abstract

A weighted graph is a graph in which every edge is assigned a non-negative real number. In a weighted graph, the weight of a path is the sum of the weights of its edges, and the weighed degree of a vertex is the sum of the weights of the edges incident with it. In this paper we give three weighted degree conditions for the existence of heavy or Hamilton paths with one or two given end-vertices in 2-connected weighted graphs.

Original language	English
Pages (from-to)	789-798
Number of pages	10
Journal	Acta Mathematicae Applicatae Sinica
Volume	33
Issue number	3
DOIs	https://doi.org/10.1007/s10255-017-0698-6
State	Published - 1 Jul 2017

Keywords

heavy path
weighed degree
weighted graph

Access to Document

10.1007/s10255-017-0698-6

Cite this

@article{7e81409992d74ae683f80277a5ca5b4f,

title = "On heavy paths in 2-connected weighted graphs",

abstract = "A weighted graph is a graph in which every edge is assigned a non-negative real number. In a weighted graph, the weight of a path is the sum of the weights of its edges, and the weighed degree of a vertex is the sum of the weights of the edges incident with it. In this paper we give three weighted degree conditions for the existence of heavy or Hamilton paths with one or two given end-vertices in 2-connected weighted graphs.",

keywords = "heavy path, weighed degree, weighted graph",

author = "Li, {Bin long} and Zhang, {Sheng gui}",

note = "Publisher Copyright: {\textcopyright} 2017, Institute of Applied Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences and Springer-Verlag GmbH Germany.",

year = "2017",

month = jul,

day = "1",

doi = "10.1007/s10255-017-0698-6",

language = "英语",

volume = "33",

pages = "789--798",

journal = "Acta Mathematicae Applicatae Sinica",

issn = "0168-9673",

publisher = "Springer Verlag",

number = "3",

}

TY - JOUR

T1 - On heavy paths in 2-connected weighted graphs

AU - Li, Bin long

AU - Zhang, Sheng gui

PY - 2017/7/1

Y1 - 2017/7/1

N2 - A weighted graph is a graph in which every edge is assigned a non-negative real number. In a weighted graph, the weight of a path is the sum of the weights of its edges, and the weighed degree of a vertex is the sum of the weights of the edges incident with it. In this paper we give three weighted degree conditions for the existence of heavy or Hamilton paths with one or two given end-vertices in 2-connected weighted graphs.

AB - A weighted graph is a graph in which every edge is assigned a non-negative real number. In a weighted graph, the weight of a path is the sum of the weights of its edges, and the weighed degree of a vertex is the sum of the weights of the edges incident with it. In this paper we give three weighted degree conditions for the existence of heavy or Hamilton paths with one or two given end-vertices in 2-connected weighted graphs.

KW - heavy path

KW - weighed degree

KW - weighted graph

UR - http://www.scopus.com/inward/record.url?scp=85027511999&partnerID=8YFLogxK

U2 - 10.1007/s10255-017-0698-6

DO - 10.1007/s10255-017-0698-6

M3 - 文章

AN - SCOPUS:85027511999

SN - 0168-9673

VL - 33

SP - 789

EP - 798

JO - Acta Mathematicae Applicatae Sinica

JF - Acta Mathematicae Applicatae Sinica

IS - 3

ER -

On heavy paths in 2-connected weighted graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this