期刊： DISCRETE APPLIED MATHEMATICS, 2021; 294 ()
Let G be a signed graph and F a set of signed circuits in G. For an edge e is an element of E(G), F(e) denotes the number of signed circuits in F that......
期刊： DISCRETE APPLIED MATHEMATICS, 2021; 299 ()
The spanning tree packing number of a graph G is the maximum number of edge-disjoint spanning trees in G, and the arboricity of G is the minimum numbe......
期刊： DISCRETE APPLIED MATHEMATICS, 2021; 293 ()
The spectral radius rho(G) of a graph G is the largest eigenvalue of its adjacency matrix A(G). In this paper, we first give a sharp lower bound of th......
期刊： DISCRETE APPLIED MATHEMATICS, 2021; 290 ()
Given a tree T and a vertex v in T, the number of subtrees of T containing v is denoted by eta(T) (v) and called the subtree number at v. Similarly, e......
期刊： DISCRETE APPLIED MATHEMATICS, 2021; 297 ()
The connectivity and edge connectivity of interconnection network determine the fault tolerance of the network. An interconnection network is usually ......
期刊： DISCRETE APPLIED MATHEMATICS, 2021; 302 ()
An edge-coloring 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 distan......
期刊： DISCRETE APPLIED MATHEMATICS, 2021; 302 ()
A graph G is said to be K-1,K-r-free if G does not contain an induced subgraph isomorphic to K-1,K-r. Let k, r, t be integers with k >= 2, r >= ......
期刊： DISCRETE APPLIED MATHEMATICS, 2021; 294 ()
In an edge-colored graph (G, c), let d(c)(v) denote the number of colors on the edges incident with a vertex v of G and delta(c)(G) denote the minimum......
期刊： DISCRETE APPLIED MATHEMATICS, 2021; 302 ()
A strong edge coloring of a graph G is an assignment of colors to the edges of G such that two distinct edges are colored differently if their distanc......
期刊： DISCRETE APPLIED MATHEMATICS, 2021; 290 ()
The transmission of a vertex v of a graph G is the sum of distances from v to all the other vertices in G. The Wiener complexity of G is the number of......
期刊： DISCRETE APPLIED MATHEMATICS, 2021; 293 ()
In this paper, we investigate the existence of Laplacian perfect state transfer and Laplacian pretty good state transfer in edge complemented coronas.......
期刊： DISCRETE APPLIED MATHEMATICS, 2021; 298 ()
A Gallai coloring of a complete graph is an edge-coloring such that no triangle has all its edges colored differently. A Gallai k-coloring is a Gallai......
期刊： DISCRETE APPLIED MATHEMATICS, 2021; 301 ()
A Gallai coloring of a complete graph is a coloring of the edges without rainbow triangles (all edges colored differently). Given a graph H and a posi......
期刊： DISCRETE APPLIED MATHEMATICS, 2021; 294 ()
Phylogenetic networks are a generalization of phylogenetic trees allowing for the representation of non-treelike evolutionary events such as hybridiza......
期刊： DISCRETE APPLIED MATHEMATICS, 2021; 300 ()
In this note, we disprove two conjectures on no hole anti-n-labeling of graphs proposed by Guan et al. (2019), and characterize a graph G with lambda(......
