-
Article
Planar Turán Numbers of Cubic Graphs and Disjoint Union of Cycles
The planar Turán number of a graph H, denoted by \(ex_{_\mathcal {P}}(n,H)\) e ...
-
Article
Coupling strength between omnivory loops and their one-species-delete subloops drives real food web stability
A central and fundamental issue in ecology is to understand the relationship between complexity and stability. Increased empirical evidences demonstrated no clear relationships between complexity metrics and s...
-
Article
Graph Classes with Locally Irregular Chromatic Index at most 4
A graph G is said to be locally irregular if each pair of adjacent vertices have different degrees in G. A collection of edge disjoint subgraphs ...
-
Article
Acyclic Edge Coloring of Chordal Graphs with Bounded Degree
An acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cycles are produced. It was conjectured that every simple graph G with maximum degree
-
Article
Mixed connectivity properties of random graphs and some special graphs
For positive integers k and \(\lambda \) λ , a graph G is
-
Article
Sharp Upper Bounds on the k-Independence Number in Graphs with Given Minimum and Maximum Degree
The k-independence number of a graph G is the maximum size of a set of vertices at pairwise distance greater than k. In this paper, for each positive integer k, we prove sharp upper bounds for the k-independence ...
-
Chapter and Conference Paper
The Smallest Number of Vertices in a 2-Arc-Strong Digraph Without Pair of Arc-Disjoint In- and Out-Branchings
Branchings play an important role in digraph theory and algorithms. In particular, a chapter in the monograph of Bang-Jensen and Gutin, Digraphs: Theory, Algorithms and Application, Ed. 2, 2009 is wholly devot...
-
Chapter and Conference Paper
k-Critical Graphs in \(P_5\) -Free Graphs
Given two graphs \(H_1\) and \(H_2\) , a gr...
-
Article
Planar Turán Numbers of Short Paths
Given a graph H, the planar Turán number of H, denoted \(ex_{\mathcal {P}}(n,H),\) ...
-
Chapter and Conference Paper
Vertex-Critical ( \(P_5\) , banner)-Free Graphs
Given two graphs \(H_1\) H ...
-
Article
Rainbow vertex connection of digraphs
An edge-coloured path is rainbow if its edges have distinct colours. An edge-coloured connected graph is said to be rainbow connected if any two vertices are connected by a rainbow path, and strongly rainbow conn...
-
Article
The Generalized 3-Connectivity of Cayley Graphs on Symmetric Groups Generated by Trees and Cycles
The generalized connectivity of a graph is a natural generalization of the connectivity and can serve for measuring the capability of a network G to connect any k vertices in G. Given a graph
-
Article
On minimally 2-connected graphs with generalized connectivity \(\kappa _{3}=2\)
For \(S\subseteq G\) S
-
Article
Open AccessErratum: Protein Sequence Comparison Based on Physicochemical Properties and the Position-Feature Energy Matrix
Scientific Reports 7: Article number: 46237; published online: 10 April 2017; updated: 04 May 2017 In the original version of this Article, Yusen Zhang was incorrectly affiliated with ‘Faculty of Science, Univ...
-
Article
Open AccessProtein Sequence Comparison Based on Physicochemical Properties and the Position-Feature Energy Matrix
We develop a novel position-feature-based model for protein sequences by employing physicochemical properties of 20 amino acids and the measure of graph energy. The method puts the emphasis on sequence order i...
-
Chapter and Conference Paper
Mixed Connectivity of Random Graphs
For positive integers k and \(\lambda \) λ ...
-
Article
Coupon coloring of some special graphs
Let G be a graph without isolated vertices. A k-coupon coloring of G is a k-coloring of G such that the neighborhood of every vertex of G contains vertices of all colors from
-
Article
Preventive effect of oral nicorandil on contrast-induced nephropathy in patients with renal insufficiency undergoing elective cardiac catheterization
This study aims to investigate the preventive effect of oral nicorandil on contrast-induced nephropathy (CIN) in patients with renal insufficiency undergoing elective cardiac catheterization. A total of 240 pa...
-
Article
Open AccessOn Wiener polarity index of bicyclic networks
Complex networks are ubiquitous in biological, physical and social sciences. Network robustness research aims at finding a measure to quantify network robustness. A number of Wiener type indices have recently ...
-
Article
Some Motzkin–Straus type results for non-uniform hypergraphs
A remarkable connection between the order of a maximum clique and the Lagrangian of a graph was established by Motzkin and Straus in 1965. This connection and its extensions were applied in Turán problems of g...
