Results 41 to 50 of about 1,962 (215)
End-regularity of generalized bicycle graph
AKCE International Journal of Graphs and Combinatorics, 2020 A graph G is called End-regular, if every endomorphism of G is regular as a monoid. In this article, we investigate End-regularity of bicycle graphs. Moreover, a generalization of bicycle graph is defined and gives a characterization of End-regular generalized bicycle graphs.
A. Rajabi, A. Erfanian, A. Azimi
openaire +2 more sources
$G$-designs for the connected triangular bicyclic graphs with nine edges [PDF]
Transactions on CombinatoricsA $G$-design of order $n$ is a decomposition of the complete graph $K_n$ into isomorphic copies of $G$. We show that if $G$ is a connected bicyclic graph with nine edges containing two triangles, a $G$-design of order $n$ exists whenever $n \equiv 0,1 ...
Bryan Freyberg +4 more
doaj +1 more source
The Upper Bound of the Edge Mostar Index with Respect to Bicyclic Graphs
Mathematics, 2023 Let G be a connected graph; the edge Mostar index Moe(G) of G is defined as Moe(G)=∑e=uv∈E(G)|mu(e)−mv(e)|, where mu(e) and mv(e) denote the number of edges in G that are closer to vertex u than to vertex v and the number of edges that are closer to ...
Hui Wang, Mengmeng Liu
doaj +1 more source
Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
, 2010 For every integer n≥4, it is proved that there is a unique graph of order n which maximizes the spectral radius of the unoriented Laplacian matrix over all bicyclic graphs of order n, namely, the graph obtained from the cycle C 4 by first adding a chord ...
Fan, Yi-zheng; 譚必信; Tam, Bit-shun; Zhou, Jun
core +1 more source
On the Hosoya Indices of Bicyclic Graphs with Small Diameter
Journal of Chemistry, 2021 Let G be a graph. The Hosoya index of G, denoted by zG, is defined as the total number of its matchings. The computation of zG is NP-Complete. Wagner and Gutman pointed out that it is difficult to obtain results of the maximum Hosoya index among tree ...
Tingzeng Wu, Yong Yu
doaj +1 more source
On the existence of non-golden signed graphs
Atti della Accademia Peloritana dei Pericolanti : Classe di Scienze Fisiche, Matematiche e Naturali, 2018 A signed graph is a pair Γ=(G,σ), where G=(V(G), E(G)) is a graph and σ: E(G) → {+1, -1} is the sign function on the edges of G. For a signed graph we consider the least eigenvalue λ(Γ) of the Laplacian matrix defined as L(Γ)=D(G)-A(Γ), where D(G) is the
Maurizio Brunetti
doaj +1 more source
Diethyl 3-amino-6-methyl-4-[(E)-2-phenylethenyl]thieno[2,3-b]pyridine-2,5-dicarboxylate
IUCrData, 2016 In the title molecule, C22H22N2O4S, the bicyclic core is slightly folded [1.9 (1)°], while pairwise intermolecular N—H...O hydrogen bonding forms dimers across centers of symmetry.
Joel T. Mague +4 more
doaj +1 more source
On Minimum Generalized Degree Distance Index of Cyclic Graphs
International Journal of Mathematics and Mathematical Sciences, 2023 Topological index (TI) is a mapping that associates a real number to the under study (molecular) graph which predicts its various physical and chemical properties.
Nadia Khan +3 more
doaj +1 more source
On the distance spread of cacti and bicyclic graphs
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yijuan Liang, Bo Zhou 0007
openaire +2 more sources
Zagreb Indices of Trees, Unicyclic and Bicyclic Graphs With Given (Total) Domination
IEEE Access, 2019 Let G = (V, E) be a (molecular) graph. For a family of graphs G, the first Zagreb index M1 and the second Zagreb index M2 have already studied. In particular, it has been presented, the first Zagreb index M1 and the second Zagreb index M2 of trees T in ...
Doost Ali Mojdeh +3 more
doaj +1 more source