Results 171 to 180 of about 891,390 (207)

Combinatorial Inversion in Edge-Weighted Unicyclic Graphs

Discrete Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel A. Jaume, Cristian Panelo
openaire   +3 more sources

Spectra of unicyclic graphs

Graphs and Combinatorics, 1987
We study lexicographic ordering of unicyclic graphs by spectral moments as well as the ordering by the largest eigenvalue. If the length of the cycle is fixed, extremal graphs in the first ordering are obtained by attaching a star and a path to a cycle. For the other ordering minimal graphs are not known.
Cvetković, Dragoš, Rowlinson, Peter
openaire   +1 more source

Vertex betweenness centrality of corona graphs and unicyclic graphs

2023
Summary: The idea of centrality measurements is quite appropriate for determining the important vertices or edges in a network. A vertex in a network may be an important vertex depending on its angle of assumption. There are many centrality measurements to find the characteristics of a vertex in a network. Betweenness centrality is an important variant
Barman, Sambhu Charan, Mondal, Sukumar, Nandi, Shaoli   +2 more
openaire   +1 more source

Inverse of \(\alpha\)-Hermitian Adjacency Matrix of a Unicyclic Bipartite Graph

Journal of Combinatorial Mathematics and Combinatorial Computing
Let \(X\) be bipartite mixed graph and for a unit complex number \(\alpha\), \(H_\alpha\) be its \(\alpha\)-hermitian adjacency matrix. If \(X\) has a unique perfect matching, then \(H_\alpha\) has a hermitian inverse \(H_\alpha^{-1}\).
Omar Alomari, Mohammad Abudayah, Omar AbuGhneim   +2 more
semanticscholar   +1 more source

Unicyclic Graphs with Minimal Energy

Journal of Mathematical Chemistry, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Trees and Unicyclic Graphs

The Mathematics Teacher, 1967
There are many results in mathematics that are both new and elementary. Graph theory, which abounds in theorems of this kind, is the source of an interesting self-contained example which we present in this article.
Sabra S. Anderson, Frank Harary
openaire   +1 more source

Unicyclic nonintegral sum graphs

Journal of Applied and Industrial Mathematics, 2008
A graph G = (V,E) is an integral sum graph if there exists a labeling S(G) ⊂ Z such that V = S(G) and every two distinct vertices u, υ ∈ V are adjacent if and only if u + υ ∈ V. A connected graph G = (V,E) is called unicyclic if |V| = |E|. In this paper two infinite series are constructed of unicyclic graphs that are not integral sum graphs.
openaire   +1 more source

Trees and unicyclic graphs with hamiltonian path graphs

Journal of Graph Theory, 1990
AbstractWe prove two conjectures of Broersma and Hoede about path graphs of trees and unicyclic graphs.
openaire   +1 more source

On broadcasting in unicyclic graphs

Journal of Combinatorial Optimization, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Harutyunyan, Hovhannes A., Maraachlian, Edward   +1 more
openaire   +1 more source

Extreme Sombor Spectral Radius of Unicyclic Graphs

Match Communications in Mathematical and in Computer Chemistry, 2023
Summary: Let \(G\) be a graph, the Sombor matrix \(S(G)\) of \(G\) was recently introduced by \textit{Z. Wang} et al. [``Spectral radius and energy of Sombor matrix of graphs'', Filomat 35, No. 15, 5093--5100 (2021; \url{doi:10.2298/FIL2115093W}]. It is a new matrix based on Sombor index, where the \((i,j)\) entry \(S_{ij}=\sqrt{d_i^2+d_j^2}\) if ...
Mei, Yinzhen, Fu, Huifeng, Miao, Hongli, Gao, Yubin   +3 more
openaire   +2 more sources