Jing Huang
YOU?
Author Swipe
View article: Strong chordality in tournaments and multipartite tournaments with possible loops
Strong chordality in tournaments and multipartite tournaments with possible loops Open
Strongly chordal digraphs are included in the class of chordal digraphs and generalize strongly chordal graphs and chordal bipartite graphs. They are the digraphs that admit a linear ordering of its vertex set for which their adjacency mat…
View article: Technology transforming nursing education: Perspectives from health care simulation
Technology transforming nursing education: Perspectives from health care simulation Open
Advancements in medical education have consistently been underpinned by corresponding progress in technology. With the ever-changing landscape of technology and health care, simulation has become an integral component of the health care de…
View article: On graphs which have locally complete 2-edge-colourings and their relationship to proper circular-arc graphs
On graphs which have locally complete 2-edge-colourings and their relationship to proper circular-arc graphs Open
A 2-edge-coloured graph $G$ is called {\bf locally complete} if for each vertex $v$, the vertices adjacent to $v$ through edges of the same colour induce a complete subgraph in $G$. Locally complete 2-edge-coloured graphs have nice propert…
View article: On the Harary Index of Graphs with Given Dissociation Number
On the Harary Index of Graphs with Given Dissociation Number Open
For a graph G = (VG, EG), a subset S ⊆ VG is called a maximum dissociation set if the induced subgraph G[S] does not contain P3 as its subgraph, and the subset has maximum cardinality.The dissociation number of G is the number of vertices …
View article: Coping with antagonistic predation risks: Predator-dependent unique responses are dominant in Ceriodaphnia cornuta
Coping with antagonistic predation risks: Predator-dependent unique responses are dominant in Ceriodaphnia cornuta Open
Inducible defenses of prey are evolved under diverse and variable predation risks. However, during the co-evolution of prey and multiple predators, the responses of prey to antagonistic predation risks, which may put the prey into a dilemm…
View article: Coping with antagonistic predation risks: Predator-dependent unique responses are dominant in Ceriodaphnia cornuta
Coping with antagonistic predation risks: Predator-dependent unique responses are dominant in Ceriodaphnia cornuta Open
This Data set include raw data (Individual traits.xlsx & All_genes_expression.xlsx ) and R scripts for data analysis.
View article: Good orientations of unions of edge‐disjoint spanning trees
Good orientations of unions of edge‐disjoint spanning trees Open
In this paper, we exhibit connections between the following subjects: Tree packing in graphs and digraphs (both behave completely different), the rigidity matroid of a graph, Henneberg moves on trees, the conjectures of Thomassen and Matth…
View article: Obstructions for acyclic local tournament orientation completions
Obstructions for acyclic local tournament orientation completions Open
The orientation completion problem for a fixed class of oriented graphs asks whether a given partially oriented graph can be completed to an oriented graph in the class. Orientation completion problems have been studied recently for severa…
View article: (k; l)-Colourings and Ferrers Diagram Representations of Cographs
(k; l)-Colourings and Ferrers Diagram Representations of Cographs Open
For a pair of natural numbers $k, l$, a $(k,l)$-colouring of a graph $G$ is a partition of the vertex set of $G$ into (possibly empty) sets $S_1, S_2, \dots, S_k$, $C_1, C_2, \dots, C_l$ such that each set $S_i$ is an independent set and e…
View article: Chordality of locally semicomplete and weakly quasi-transitive digraphs
Chordality of locally semicomplete and weakly quasi-transitive digraphs Open
Chordal graphs are important in the structural and algorithmic graph theory. A digraph analogue of chordal graphs was introduced by Haskin and Rose in 1973 but has not been a subject of active studies until recently when a characterization…
View article: Strongly chordal digraphs and $\Gamma$-free matrices.
Strongly chordal digraphs and $\Gamma$-free matrices. Open
We define strongly chordal digraphs, which generalize strongly chordal graphs\nand chordal bipartite graphs, and are included in the class of chordal\ndigraphs. They correspond to square 0,1 matrices that admit a simultaneous row\nand colu…
View article: Strongly chordal digraphs and $Γ$-free matrices
Strongly chordal digraphs and $Γ$-free matrices Open
We define strongly chordal digraphs, which generalize strongly chordal graphs and chordal bipartite graphs, and are included in the class of chordal digraphs. They correspond to square 0,1 matrices that admit a simultaneous row and column …
View article: Good orientations of 2T-graphs
Good orientations of 2T-graphs Open
In this paper we study graphs which admit acyclic orientations that contain a pair of arc-disjoint out-branching and in-branching (such an orientation is called good) and we focus on edge-minimal such graphs. A 2T-graph is a graph whose ed…
View article: Comparability and Cocomparability Bigraphs
Comparability and Cocomparability Bigraphs Open
We propose bipartite analogues of comparability and cocomparability graphs. Surprizingly, the two classes coincide. We call these bipartite graphs cocomparability bigraphs. We characterize cocomparability bigraphs in terms of vertex orderi…
View article: Interval-Like Graphs and Digraphs
Interval-Like Graphs and Digraphs Open
We unify several seemingly different graph and digraph classes under one umbrella. These classes are all broadly speaking different generalizations of interval graphs, and include, in addition to interval graphs, also adjusted interval dig…
View article: Further results on the expected hitting time, the cover cost and the related invariants of graphs
Further results on the expected hitting time, the cover cost and the related invariants of graphs Open
A close relation between hitting times of the simple random walk on a graph, the Kirchhoff index, resistance-centrality, and related invariants of unicyclic graphs is displayed. Combining with the graph transformations and some other techn…
View article: Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
Relation between the skew-rank of an oriented graph and the independence number of its underlying graph Open
An oriented graph $G^σ$ is a digraph without loops or multiple arcs whose underlying graph is $G$. Let $S\left(G^σ\right)$ be the skew-adjacency matrix of $G^σ$ and $α(G)$ be the independence number of $G$. The rank of $S(G^σ)$ is called t…
View article: On the spectral characterizations of graphs
On the spectral characterizations of graphs Open
Several matrices can be associated to a graph, such as the adjacency matrix or the Laplacian matrix. The spectrum of these matrices gives some informations about the structure of the graph and the question “Which graphs are determined by t…