Results 31 to 40 of about 1,156,434 (264)
Eccentricity of Networks with Structural Constraints
Discussiones Mathematicae Graph Theory, 2020 The eccentricity of a node v in a network is the maximum distance from v to any other node. In social networks, the reciprocal of eccentricity is used as a measure of the importance of a node within a network.
Krnc Matjaž +3 more
doaj +1 more source
Maximum Reciprocal Degree Resistance Distance Index of Bicyclic Graphs
Discrete Dynamics in Nature and Society, 2021 The reciprocal degree resistance distance index of a connected graph G is defined as RDRG=∑u,v⊆VGdGu+dGv/rGu,v, where rGu,v is the resistance distance between vertices u and v in G. Let ℬn denote the set of bicyclic graphs without common edges and with n
Gaixiang Cai, Xing-Xing Li, Guidong Yu
doaj +1 more source
Average eccentricity, minimum degree and maximum degree in graphs [PDF]
Journal of Combinatorial Optimization, 2020 Let $G$ be a connected finite graph with vertex set $V(G)$. The eccentricity $e(v)$ of a vertex $v$ is the distance from $v$ to a vertex farthest from $v$. The average eccentricity of $G$ is defined as $\frac{1}{|V(G)|}\sum_{v \in V(G)}e(v)$. We show that the average eccentricity of a connected graph of order $n$, minimum degree $ $ and maximum degree
P. Dankelmann, F. J. Osaye
openaire +2 more sources
, 2017 Given a graph $G$, we would like to find (if it exists) the largest induced subgraph $H$ in which there are at least $k$ vertices realizing the maximum degree of $H$. This problem was first posed by Caro and Yuster. They proved, for example, that for every graph $G$ on $n$ vertices we can guarantee, for $k = 2$, such an induced subgraph $H$ by deleting
Caro, Yair +2 more
openaire +3 more sources
Vertex arboricity and maximum degree
Discrete Mathematics, 1995 This paper mainly proves that if a connected graph \(G= (V,E)\) is neither a cycle nor a clique, then there is a coloring of \(V\) with at most \(\lceil {{\Delta (G)} \over 2} \rceil\) colors such that all color classes induce forests and one of them is a minimum induced forest in \(G\).
Catlin, Paul A., Lai, Hong-Jian
openaire +1 more source
On the Maximum ABS Index of Fixed-Order Trees with a Given Maximum Degree
MathematicsThe ABS (atom-bond sum-connectivity) index of a graph G is denoted by ABS(G) and is defined as ∑xy∈E(G)(dx+dy)−1(dx+dy−2), where dx represents the degree of the vertex x in G.
Venkatesan Maitreyi +5 more
doaj +1 more source
(1,2)-PDS in graphs with the small number of vertices of large degrees [PDF]
Opuscula MathematicaWe define and study a perfect \((1,2)\)-dominating set which is a special case of a \((1,2)\)-dominating set. We discuss the existence of a perfect \((1,2)\)-dominating set in graphs with at most two vertices of maximum degree.
Urszula Bednarz, Mateusz Pirga
doaj +1 more source
Intersection Dimension and Maximum Degree
Electronic Notes in Discrete Mathematics, 2009 Abstract We show that the intersection dimension of graphs with respect to several hereditary properties can be bounded as a function of the maximum degree. As an interesting special case, we show that the circular dimension of a graph with maximum degree Δ is at most O ( Δ log Δ log log Δ ) .
N.R. Aravind, C.R. Subramanian
openaire +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Neuroblastoma is the most common extracranial solid tumor in early childhood. Its clinical behavior is highly variable, ranging from spontaneous regression to fatal outcome despite intensive treatment. The International Society of Pediatric Oncology Europe Neuroblastoma Group (SIOPEN) Radiology and Nuclear Medicine Specialty Committees ...
Annemieke Littooij +11 more
wiley +1 more source
New Bounds For Degree Sequence Of Graphs [PDF]
Computer Science Journal of Moldova, 2019 Let $G = (V, E)$ be a simple graph with $n$ vertices, $m$ edges, and vertex degrees $d_1, d_2, ..., d_n$. Let $d_1, d_n$ be the maximum and and minimum degree of vertices. In this paper, we present lower and upper bounds for $\sum_{i=1}^{n}d_i^{2}$ and
Akbar Jahanbani
doaj