相关论文: More on Comparison Between First Geometric-Arithme…

We define the following parameter of connected graphs. For a given graph $G$ we place one agent in each vertex of $G$. Every pair of agents sharing a common edge is declared to be acquainted. In each round we choose some matching of $G$…

For a graph $G = (V, E)$, the $\gamma$-graph of $G$, denoted $G(\gamma) = (V(\gamma), E(\gamma))$, is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent in…

We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…

Interactions and relations between objects may be pairwise or higher-order in nature, and so network-valued data are ubiquitous in the real world. The "space of networks", however, has a complex structure that cannot be adequately described…

A cut of a graph can be represented in many different ways. Here we propose to represent a cut through a ``relation tree'', which is a spanning tree with signed edges. We show that this picture helps to classify the main greedy heuristics…

Geometric, topological and graph theory modeling and analysis of biomolecules are of essential importance in the conceptualization of molecular structure, function, dynamics, and transport. On the one hand, geometric modeling provides…

Let $d,n\in \mathbb{N}$ be such that $d=\omega(1)$, and $d\le n^{1-a}$ for some constant $a>0$. Consider a $d$-regular graph $G=(V, E)$ and the random graph process that starts with the empty graph $G(0)$ and at each step $G(i)$ is obtained…

For $S\subseteq V(G)$ and $|S|\geq 2$, $\lambda(S)$ is the maximum number of edge-disjoint trees connecting $S$ in $G$. For an integer $k$ with $2\leq k\leq n$, the \emph{generalized $k$-edge-connectivity} $\lambda_k(G)$ of $G$ is then…

The principal ratio of a connected graph $G$, $\gamma(G)$, is the ratio between the largest and smallest coordinates of the principal eigenvector of the adjacency matrix of $G$. Over all connected graphs on $n$ vertices, $\gamma(G)$ ranges…

Let $d_G(v)$ be the degree of the vertex $v$ in a graph $G$. The Sombor index of $G$ is defined as $SO(G) =\sum_{uv\in E(G)}\sqrt{d^2_G(u)+d^2_G(v)}$, which is a new degree-based topological index introduced by Gutman. Let…

One of the defining features of complex networks is the connectivity properties that we observe emerging from local interactions. Recently, hypergraphs have emerged as a versatile tool to model networks with non-dyadic, higher-order…

A distinguishing index of a (di)graph is the minimum number of colours in an edge (or arc) colouring such that the identity is the only automorphism that preserves that colouring. We investigate the minimum and maximum value of the…

Distributional and neural approaches to natural language semantics have been built almost exclusively on conventional linear algebra: vectors, matrices, tensors, and the operations that accompany them. These methods have achieved remarkable…

For a given multigraph H, a graph G is H-linked, if |G| \geq |H| and for every injective map {\tau}: V (H) \rightarrow V (G), we can find internally disjoint paths in G, such that every edge from uv in H corresponds to a {\tau} (u) - {\tau}…

Using density functional theory calculations, we have investigated the structural, energetic, and electronic properties of ternary graphite intercalation compounds (GICs) containing alkali atoms (AM) and normal alkylamine molecules (nC$x$),…

Assortativity was first introduced by Newman and has been extensively studied and applied to many real world networked systems since then. Assortativity is a graph metrics and describes the tendency of high degree nodes to be directly…

It is well--known that if one is given a principal $G$--bundle with a principal connection, then for every unitary finite--dimensional linear representation of $G$ one can induce a linear connection and a Hermitian structure on the…

Let $q(G)$ denote the $Q$-index of a graph $G$, which is the largest signless Laplacian eigenvalue of $G$. We prove best possible upper bounds of $q(G)$ and best possible lower bounds of $q(\overline{G})$ for a connected graph $G$ to be…

The Sombor index is one of the geometry-based descriptors, which was defined as $$SO(G)=\sum_{uv\in E(G)}\sqrt{d^{2}(u)+d^{2}(v)},$$ where $d(u)$ (resp. $d(v)$) denotes the degree of vertex $u$ (resp. $v$) in $G$. In this note, we determine…

Chemical graphs are simple undirected connected graphs, where vertices represent atoms in a molecule and edges represent chemical bonds. A degree-based topological index is a molecular descriptor used to study specific physicochemical…