Results 101 to 110 of about 305 (179)

On Hamiltonian Decomposition Problem of 3-Arc Graphs. [PDF]

open access: yesComput Intell Neurosci, 2022
Xu G, Sun Q, Liang Z.
europepmc   +1 more source

Planar packing of cycles and unicyclic graphs

open access: yesDemonstratio Mathematica, 2009
AbstractWe say that a graphIn this paper we show that for any packable ...
openaire   +1 more source

The minimum matching energy of unicyclic graphs with fixed number of vertices of degree two

open access: yesOpen Mathematics
The number of jj-matchings in a graph HH is denote by m(H,j)m\left(H,j). If for two graphs H1{H}_{1} and H2{H}_{2}, m(H1,j)≥m(H2,j)m\left({H}_{1},j)\ge m\left({H}_{2},j) for all jj, then we write H1≽H2{H}_{1}\succcurlyeq {H}_{2}.
Bai Yongqiang, Ma Hongping, Zhang Xia
doaj   +1 more source

On detour index of cycloparaphenylene and polyphenylene molecular structures. [PDF]

open access: yesSci Rep, 2021
Prabhu S   +4 more
europepmc   +1 more source

Power Graphs of Finite Groups Determined by Hosoya Properties. [PDF]

open access: yesEntropy (Basel), 2022
Ali F   +4 more
europepmc   +1 more source

Local Multiset Dimension of Amalgamation Graphs. [PDF]

open access: yesF1000Res, 2023
Alfarisi R   +3 more
europepmc   +1 more source

Ordering Unicyclic Graphs in Terms of Their Smaller Least Eigenvalues

open access: yesJournal of Inequalities and Applications, 2010
Let be a simple graph with vertices, and let be the least eigenvalue of . The connected graphs in which the number of edges equals the number of vertices are called unicyclic graphs.
Xu Guang-Hui
doaj  

Home - About - Disclaimer - Privacy