相关论文: Remarks on the maximum atom-bond connectivity inde…

A path in an edge-colored graph is called proper if no two consecutive edges of the path receive the same color. For a connected graph $G$, the proper connection number $pc(G)$ of $G$ is defined as the minimum number of colors needed to…

Many existing degree based topological indices can be classified as bond incident degree (BID) indices, whose general form is $BID(G)=\sum_{uv\in E(G)}$ $\Psi(d_{u},d_{v})$, where $uv$ is the edge connecting the vertices $u,v$ of the graph…

In this paper a tight lower bound for algebraic connectivity of graphs (second smallest eigenvalue of the Laplacian matrix of the graph) based on connection-graph-stability method is introduced. The connection-graph-stability score for each…

The bond graph approach to modelling biochemical networks is extended to allow hierarchical construction of complex models from simpler components. This is made possible by representing the simpler components as thermodynamically open…

Given a graphical degree sequence ${\bf d}=(d_1,\ldots, d_n)$, let $G(n, {\bf d})$ denote a uniformly random graph on vertex set $[n]$ where vertex $ i$ has degree $d_i$ for every $1\le i\le n$. We give upper and lower bounds on the joint…

We study the properties of the giant connected component in random graphs with arbitrary degree distribution. We concentrate on the degree-degree correlations. We show that the adjoining nodes in the giant connected component are correlated…

Given two subsets A and B of nodes in a directed graph, the conduciveness of the graph from A to B is the ratio representing how many of the edges outgoing from nodes in A are incoming to nodes in B. When the graph's nodes stand for the…

In principle, the rules of links formation of a network model can be considered as a kind of link prediction algorithm. By revisiting the preferential attachment mechanism for generating a scale-free network, here we propose a class of…

We introduce a formalism for computing bond percolation properties of a class of correlated and clustered random graphs. This class of graphs is a generalization of the Configuration Model where nodes of different types are connected via…

A coloring of edges of a graph $G$ is injective if for any two distinct edges $e_1$ and $e_2$, the colors of $e_1$ and $e_2$ are distinct if they are at distance $1$ in $G$ or in a common triangle. Naturally, the injective chromatic index…

We show that any $2-$factor of a cubic graph can be extended to a maximum $3-$edge-colorable subgraph. We also show that the sum of sizes of maximum $2-$ and $3-$edge-colorable subgraphs of a cubic graph is at least twice of its number of…

We consider the following extension of the concept of adjacent strong edge colourings of graphs without isolated edges. Two distinct vertices which are at distant at most $r$ in a graph are called $r$-adjacent. The least number of colours…

This paper aims to maximize algebraic connectivity of networks via topology design under the presence of constraints and an adversary. We are concerned with three problems. First, we formulate the concave maximization topology design…

We employ the mathematical programming approach in conjunction with the graph theory to study the structure of correspondent banking networks. Optimizing the network requires decisions to be made to onboard, terminate or restrict the bank…

Let $G$ be a graph with edge set $E(G)$. Denote by $d_w$ the degree of a vertex $w$ of $G$. The sigma index of $G$ is defined as $\sum_{uv\in E(G)}(d_u-d_v)^2$. A connected graph of order $n$ and size $n+k-1$ is known as a connected…

Thermodynamic aspects of chemical reactions have a long history in the Physical Chemistry literature. In particular, biochemical cycles - the building-blocks of biochemical systems - require a source of energy to function. However, although…

We propose a class of networks which can be regarded as an extension of the graphitic network. These networks are constructed so that surface states with non-bonding character (edge states) are formed in a tight-binding model with one…

A 2-edge-colored graph or a signed graph is a simple graph with two types of edges. A homomorphism from a 2-edge-colored graph $G$ to a 2-edge-colored graph $H$ is a mapping $\varphi: V(G) \rightarrow V(H)$ that maps every edge in $G$ to an…

Given an edge-coloring of a graph, the palette of a vertex is defined as the set of colors of the edges which are incident with it. We define the palette index of a graph as the minimum number of distinct palettes, taken over all…

This work aims to assess the molecular architectures of anti-tuberculosis drugs using both degree-based topological indices and novel distance based indices. We can represent the chemical arrangement as a graph, with atoms serving as the…