6 hasil untuk "Yaoping Hou"
Menampilkan 1–6 · 0,54 detik · RSS
-
Artikel Jurnal
The resistance distance and the Kirchhoff index of the k -th semi total point graphs
The k -th semi total point graph R^k (G) of a graph G , is a graph obtained from G by adding k vertices corresponding to each edge and connecting them to endpoint of edge considered. In this paper, we obtain formulae for the resistance distance and Kirchhoff index of R^k (G) .
-
Artikel Jurnal
-borderenergetic graphs
A graph is said to be borderenergetic (-borderenergetic, respectively) if its energy (Laplacian energy, respectively) equals the energy (Laplacian energy, respectively) of the complete graph . We extend this concept to signless Laplacian energy of a graph. A graph is called -borderenergetic if its…
-
Artikel Jurnal
The \(\mathscr{G}\)-average of adjacency and Laplacian polynomials of a graph
Let \(\mathscr{G}\) be a finite multiplicative group of quaternion unit \(U(\mathbb{H})\). The \(\mathscr{G}\)-average of adjacency (resp., Laplacian) polynomial of a graph \(G\) is defined as the arithmetic mean of the characteristic polynomials of adjacency (resp., Laplacian) matrice of all…
-
Artikel Jurnal
The adjacency spectrum of two new operations of graphs
Let be a graph and be its adjacency matrix. The eigenvalues of are the eigenvalues of and form the adjacency spectrum, denoted by . In this paper, we introduce two new operations and , and describe the adjacency spectra of and of regular graphs , and arbitrarily graphs , in terms of their adjacency…
Juga tersedia di: DOAJ
-
Artikel Jurnal
On two energy-like invariants of line graphs and related graph operations
Abstract For a simple graph G of order n, let μ 1 ≥ μ 2 ≥ ⋯ ≥ μ n = 0 $\mu_{1}\geq\mu_{2}\geq\cdots\geq\mu_{n}=0$ be its Laplacian eigenvalues, and let q 1 ≥ q 2 ≥ ⋯ ≥ q n ≥ 0 $q_{1}\geq q_{2}\geq\cdots\geq q_{n}\geq0$ be its signless Laplacian eigenvalues. The Laplacian-energy-like invariant and…