Results 71 to 80 of about 6,572,416 (223)
On a lower bound for the eccentric connectivity index of graphs
, 2018 The eccentric connectivity index of a graph $G$, denoted by $\xi^{c}(G)$, defined as $\xi^{c}(G)$ = $\sum_{v \in V(G)}\epsilon(v) \cdot d(v)$, where $\epsilon(v)$ and $d(v)$ denotes the eccentricity and degree of a vertex $v$ in a graph $G$, respectively.
Bantva, Devsi
core +1 more source
Spectral Theory of Infinite Quantum Graphs [PDF]
, 2018 We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a close connection
Exner, Pavel +3 more
core +3 more sources
Aspherical Word Labeled Oriented Graphs and Cyclically Presented Groups
, 2014 A {\em word labeled oriented graph} (WLOG) is an oriented graph $\cal G$ on vertices $X=\{ x_1,\ldots ,x_k\}$, where each oriented edge is labeled by a word in $X^{\pm1}$. WLOGs give rise to presentations which generalize Wirtinger presentations of knots.
Harlander, Jens, Rosebrock, Stephan
core +1 more source
Commuting Conjugacy Class Graph of The Finite $2-$Groups $G_n(m)$ and $G[n]$ [PDF]
Journal of Mahani Mathematical ResearchSuppose $G$ is a finite non-abelian group and $\Gamma(G)$ is a graph with non-central conjugacy classes of $G$ as its vertex set. Two vertices $L$ and $K$ in $\Gamma(G)$ are adjacent if there are $a \in L$ and $b \in K$ such that $ab = ba$.
Mohammad Ali Salahshour +1 more
doaj +1 more source
Graph-based prediction of Protein-protein interactions with attributed signed graph embedding
BMC Bioinformatics, 2020 Protein-protein interactions (PPIs) are central to many biological processes. Considering that the experimental methods for identifying PPIs are time-consuming and expensive, it is important to develop automated computational methods to better predict ...
Fang Yang +3 more
semanticscholar +1 more source
Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph
, 2015 Baker and Norine introduced a graph-theoretic analogue of the Riemann-Roch theory. A central notion in this theory is the rank of a divisor. In this paper we prove that computing the rank of a divisor on a graph is NP-hard.
Kiss, Viktor, Tóthmérész, Lilla
core +1 more source
PCG-cut: graph driven segmentation of the prostate central gland. [PDF]
PLoS ONE, 2013 Prostate cancer is the most abundant cancer in men, with over 200,000 expected new cases and around 28,000 deaths in 2012 in the US alone. In this study, the segmentation results for the prostate central gland (PCG) in MR scans are presented.
Jan Egger
doaj +1 more source
Absorbing random-walk centrality: Theory and algorithms
, 2015 We study a new notion of graph centrality based on absorbing random walks. Given a graph $G=(V,E)$ and a set of query nodes $Q\subseteq V$, we aim to identify the $k$ most central nodes in $G$ with respect to $Q$.
Gionis, Aristides +2 more
core +1 more source
Assessing Graph Robustness through Modified Zagreb Index
Axioms, 2022 Graph robustness or network robustness is the ability that a graph or a network preserves its connectivity or other properties after the loss of vertices and edges, which has been a central problem in the research of complex networks.
Rui Chen, Jianping Li, Weihua He
doaj +1 more source
Finding structural anomalies in star graphs: A general approach
, 2014 We develop a general theory for a quantum-walk search on a star graph. A star graph has N edges each of which is attached to a central vertex. A graph G is attached to one of these edges, and we would like to find out to which edge it is attached.
Cottrell, Seth, Hillery, Mark
core +1 more source