Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi !

One-two descriptor of graphs (CROSBI ID 179847)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Das, Kinkar ; Gutman, Ivan ; Vukičević, Damir One-two descriptor of graphs // Bulletin - Académie serbe des sciences et des arts. Classe des sciences mathématiques et naturelles. Sciences mathématiques, 143 (2011), 37-47

Podaci o odgovornosti

Das, Kinkar ; Gutman, Ivan ; Vukičević, Damir

engleski

One-two descriptor of graphs

In a recent paper [Vuki·cevi¶c et al., J. Math. Chem. 48 (2010) 395- 400] a novel molecular{;graph{;based structure descriptor, named one{;two descriptor (OT), was introduced. OT is the sum of vertex contributions, such that each pendent vertex contributes 1, each vertex of degree two adjacent to a pendent vertex contributes 2, and each vertex of degree higher than two also contributes 2. Vertices of degree two, not adjacent to a pendent vertex, do not contribute to OT. Vuku·cevi¶c et al. established lower and upper bounds on OT for trees. We now give lower and upper bounds on OT for general graphs, and also characterize the extremal graphs. The bounds of Vuki·cevi¶c et al. for trees follows as a special case. Moreover, we give another upper bound on OT for trees.

one{;two descriptor; graph (molecular); degree (of vertex); molecular structure descriptor

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

143

2011.

37-47

objavljeno

0561-7332

2406-0909

Povezanost rada

Kemija, Matematika

Indeksiranost