On diameter and inverse degree of chemical graphs

Content Provider	Semantic Scholar
Author	Chen, Xue-Gang Fujita, Shinya
Copyright Year	2012
Abstract	Graph theory terminology not presented here can be found in [6]. Let G = (V,E) be a graph with |V | = n(G). The degree, neighborhood and closed neighborhood of a vertex v in the graph G are denoted by d(v), N(v) and N [v] = N(v)∪{v}, respectively. The minimum degree and maximum degree of the graph G are denoted by δ(G) and ∆(G), respectively. The graph induced by S ⊆ V is denoted by G[S]. Let G − S = G[V − S]. The graph induced by E ⊆ E is denoted by G[E]. Let G − E = G[E − E]. The distance dG(u, v) between two vertices u and v of G is the length of the shortest u − v path in G, and the diameter is diam(G) = max{dG(u, v) : u, v ∈ V }. The inverse degree r(G) of G is defined as r(G) = ∑
File Format	PDF HTM / HTML
Alternate Webpage(s)	http://pefmath.etf.rs/accepted/1422_nnv.pdf
Alternate Webpage(s)	http://www.doiserbia.nb.rs/img/doi/1452-8630/2013/1452-86301200022C.pdf
Language	English
Access Restriction	Open
Subject Keyword	Diameter (qualifier value) Graph (discrete mathematics) Graph - visual representation IBM ThinkPad 310 Molecular graph Vertex
Content Type	Text
Resource Type	Article