Add to ORKGAbstractLet G be a graph. The partially square graph G∗ of G is a graph obtained from G by adding ed...
AbstractLet G be a 2-connected graph with n vertices such that d(u)+d(v)+d(w)-|N(u)∩N(v)∩N(w)| ⩾n + ...
Suppose $mu_1$, $mu_2$, ... , $mu_n$ are Laplacian eigenvalues of a graph $G$. The Laplacian energy ...
AbstractAssume that n and δ are positive integers with 3≤δ<n. Let hc(n,δ) be the minimum number of e...
2010 Mathematics Subject Classification: 05C38, 05C45.In 1952, Dirac introduced the degree type cond...
AbstractBondy and Chvátal (1976) [7] introduced a general and unified approach to a variety of graph...
AbstractIn 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u)+d(v)⩾n for ev...
AbstractG = 〈V(G), E(G)〉 denotes a directed graph without loops and multiple arrows. K(G) denotes th...
AbstractA graph G is n-hamiltonian (resp. n-edge hamiltonian) if after the removal of any k vertices...
AbstractFor a nontrivial connected graph G, its Harary index H(G) is defined as ∑{u,v}⊆V(G)1dG(u,v),...
AbstractD. Bauer, H. J. Broersma, R. Li, and H. J. Veldman proved that ifGis a 2-connected graph wit...
AbstractBondy and Chvátal have observed the following result: G=(V,E) is a simple graph of order n. ...
A graph {\color{black}$G$} is Hamilton-connected if for any pair of distinct vertices {\color{black}...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
AbstractEl-Zahar (1984) conjectured that if G is a graph on n1+n2+⋯+nk vertices with ni⩾3 for 1⩽i⩽k ...
AbstractLet G be a graph. The partially square graph G∗ of G is a graph obtained from G by adding ed...
AbstractLet G be a 2-connected graph with n vertices such that d(u)+d(v)+d(w)-|N(u)∩N(v)∩N(w)| ⩾n + ...
Suppose $mu_1$, $mu_2$, ... , $mu_n$ are Laplacian eigenvalues of a graph $G$. The Laplacian energy ...
AbstractAssume that n and δ are positive integers with 3≤δ<n. Let hc(n,δ) be the minimum number of e...
2010 Mathematics Subject Classification: 05C38, 05C45.In 1952, Dirac introduced the degree type cond...
AbstractBondy and Chvátal (1976) [7] introduced a general and unified approach to a variety of graph...
AbstractIn 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u)+d(v)⩾n for ev...
AbstractG = 〈V(G), E(G)〉 denotes a directed graph without loops and multiple arrows. K(G) denotes th...
AbstractA graph G is n-hamiltonian (resp. n-edge hamiltonian) if after the removal of any k vertices...
AbstractFor a nontrivial connected graph G, its Harary index H(G) is defined as ∑{u,v}⊆V(G)1dG(u,v),...
AbstractD. Bauer, H. J. Broersma, R. Li, and H. J. Veldman proved that ifGis a 2-connected graph wit...
AbstractBondy and Chvátal have observed the following result: G=(V,E) is a simple graph of order n. ...
A graph {\color{black}$G$} is Hamilton-connected if for any pair of distinct vertices {\color{black}...
In this paper we prove that if G is a (k + 2)-connected graph on n > 3 vertices satisfying P(n + ...
AbstractEl-Zahar (1984) conjectured that if G is a graph on n1+n2+⋯+nk vertices with ni⩾3 for 1⩽i⩽k ...
AbstractLet G be a graph. The partially square graph G∗ of G is a graph obtained from G by adding ed...
AbstractLet G be a 2-connected graph with n vertices such that d(u)+d(v)+d(w)-|N(u)∩N(v)∩N(w)| ⩾n + ...
Suppose $mu_1$, $mu_2$, ... , $mu_n$ are Laplacian eigenvalues of a graph $G$. The Laplacian energy ...