Results 11 to 20 of about 2,448,104 (66)
Unicyclic graphs with bicyclic inverses [PDF]
, 2017 summary:A graph is nonsingular if its adjacency matrix $A(G)$ is nonsingular. The inverse of a nonsingular graph $G$ is a graph whose adjacency matrix is similar to $A(G)^{-1}$ via a particular type of similarity.
Panda, Swarup Kumar
core +3 more sources
High-ordered spectral characterization of unicyclic graphs [PDF]
, 2022 In this paper we will apply the tensor and its traces to investigate the spectral characterization of unicyclic graphs. Let $G$ be a graph and $G^m$ be the $m$-th power (hypergraph) of $G$.
Yi-Zheng Fan +5 more
core +2 more sources
Moore mixed graphs from Cayley graphs [PDF]
, 2023 A Moore (r, z, k)-mixed graph G has every vertex with undirected degree r, directed in- and outdegree z, diameter k, and number of vertices (or order) attaining the corresponding Moore bound M(r, z, k) for mixed graphs.
Dalfó Simó, Cristina +1 more
core +1 more source
Bipartite Permutation Graphs are Reconstructible [PDF]
, 2012 The graph reconstruction conjecture is a long-standing open problem in graph theory. The conjecture has been verified for all graphs with at most 11 vertices.
Uehara, Ryuhei +2 more
core +1 more source
Edge-grafting theorems on permanents of Laplacian matrices of graphs and their applications [PDF]
, 2013 The trees, respectively unicyclic graphs, on n vertices with the smallest Laplacian permanent are studided. In this paper, by edge-grafting transformations, the n-vertex trees of given pipartitino having the second and the third smallest Laplacian ...
Li, Yan, Li, Shuchao, Zhang, Xixi
core +1 more source
Minor-obstructions for apex sub-unicyclic graphs
, 2020 International audienceA graph is {\em sub-unicyclic} if it contains at most one cycle. A graph $G$ is {\em $k$-apex sub-unicyclic} if it can become sub-unicyclic by removing $k$ of its vertices.
Velona, Vasiliki +5 more
core +2 more sources
On bipartite-mixed graphs [PDF]
, 2018 This is the peer reviewed version of the following article: Dalfo, C., Fiol, M., López, N. On bipartite-mixed graphs. "Journal of graph theory", 24 Abril 2018, p.
Nacho López +5 more
core +1 more source
NONSINGULAR UNICYCLIC MIXED GRAPHS WITH AT MOST THREE EIGENVALUES GREATER THAN TWO [PDF]
, 2007 This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most three Laplacian eigenvalues greater than ...
Fan, Yi-Zheng +3 more
core +1 more source
On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree [PDF]
, 2017 In this paper, we determine the unique graph whose least signless Laplacian eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with maximum degree Δ and among all non-bipartite connected graphs of order n with maximum ...
Shu-Guang Guo, Rong Zhang
core +1 more source
Decomposition of complete graphs into connected bipartite unicyclic graphs with eight edges
, 2019 We prove that each of the 34 non-isomorphic connected unicyclic bipartite graphs with eight edges decomposes the complete graph Kn whenever the necesary conditions are satisfied.
John Fahnenstiel, Dalibor Froncek
core +1 more source