Results 21 to 30 of about 2,448,104 (66)
On the Estrada index of unicyclic and bicyclic signed graphs [PDF]
, 2023 Let $\Gamma=(G, \sigma)$ be a signed graph of order $n$ with eigenvalues $\mu_1,\mu_2,\ldots,\mu_n.$ We define the Estrada index of a signed graph $\Gamma$ as $EE(\Gamma)=\sum_{i=1}^ne^{\mu_i}$.
Pirzada, S. +2 more
core
Unicyclic graphs with large energy
, 2011 We study the energy (i.e., the sum of the absolute values of all eigenvalues) of so-called tadpole graphs, which are obtained by joining a vertex of a cycle to one of the ends of a path.
Stephan Wagner +3 more
core +1 more source
Bipartite unicyclic graphs with maximal, second-maximal, and third-maximal energy [PDF]
, 2007 Based on the results of the preceding paper [H. Hua, MATCH Commun. Math. Comput. Chem. 58 (2007) 57–73], by means of an appropriate computer search, the bipartite unicyclic n-vertex graphs with greatest, second–greatest, and third–greatest energy are ...
Furtula, Boris +2 more
core
Smarandachely t-path step signed graphs [PDF]
, 2010 Characterizing signed graphs which are switching equivalent to their Smarandachely 3-path step signed ...
Reddy, Siva Kota +5 more
core +1 more source
Decomposing dense bipartite graphs into 4-cycles [PDF]
, 2015 Let G be an even bipartite graph with partite sets X and Y such that |Y | is even and the minimum degree of a vertex in Y is at least 95|X|/96. Suppose furthermore that the number of edges in G is divisible by 4.
Nicholas J. Cavenagh +1 more
core
On degree sets and the minimum orders in bipartite graphs
, 2014 For any simple graph G, let D(G) denote the degree set {degG(v) : v ∈ V (G)}. Let S be a finite, nonempty set of positive integers. In this paper, we first determine the families of graphs G which are unicyclic, bipartite satisfying D(G) = S, and further
Patil H.P., Manoussakis Y.
core +1 more source
Non-bipartite graphs of small Mahler measure [PDF]
, 2013 We classify all non-bipartite graphs that have Mahler measurebelow12(1 +√5). (The bipartite case was covered in an earlier paper by thesecond and third authors.
McKee, James, Smyth, Christopher
core
On bipartite graphs with complete bipartite star complements
, 2014 Let G be a bipartite graph with μ as an eigenvalue of multiplicity k>1k>1. We show that if G has Kr,sKr,s(1≤r≤s)(1≤r≤s) as a star complement for μ then k≤s-1k≤s-1; moreover if μ is non-main then k≤s-2k≤s-2 for large enough s .
Rowlinson, Peter
core +1 more source
The Entropy of Weighted Graphs with Atomic Bond Connectivity Edge Weights
, 2018 The aim of this report to solve the open problem suggested by Chen et al. We study the graph entropy with ABC edge weights and present bounds of it for connected graphs, regular graphs, complete bipartite graphs, chemical graphs, tree, unicyclic graphs ...
Young Chel Kwun +4 more
core +1 more source
Regular embeddings of complete bipartite maps: classification and enumeration
The regular embeddings of complete bipartite graphs Kn, n in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined.
Jones, Gareth
core +1 more source