Results 41 to 50 of about 6,957 (218)
Synthesis of 2-(Quinoxalin-2-yl)acetamides and Their Preliminary Cytotoxic and Antibacterial Activity. [PDF]
Chem BiodiversABSTRACT Quinoxaline is an aza‐heterocycle found in some bioactive compounds. Thus, to enhance the pharmacological scope of this nucleus, we report a series of 19 acetamides decorated with a quinoxaline core. The synthesis involved the linkage of previously constructed bromoacetamides and hydroxyphenyl quinoxalines via an SN2 reaction. The first series
Tovar-Roman CE +2 more
europepmc +2 more sources
Principalization algorithm via class group structure [PDF]
, 2014 For an algebraic number field K with 3-class group \(Cl_3(K)\) of type (3,3), the structure of the 3-class groups \(Cl_3(N_i)\) of the four unramified cyclic cubic extension fields \(N_i\), \(1\le i\le 4\), of K is calculated with the aid of ...
Mayer, Daniel C.
core +2 more sources
Unicyclic graphs with bicyclic inverses [PDF]
Czechoslovak Mathematical Journal, 2017 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. Let H denote the class of connected bipartite graphs with unique perfect matchings.
openaire +1 more source
On minimum algebraic connectivity of graphs whose complements are bicyclic
Open Mathematics, 2019 The second smallest eigenvalue of the Laplacian matrix of a graph (network) is called its algebraic connectivity which is used to diagnose Alzheimer’s disease, distinguish the group differences, measure the robustness, construct multiplex model ...
Liu Jia-Bao +3 more
doaj +1 more source
Mathematics, 2023 Degree sequence measurements on graphs have attracted a lot of research interest in recent decades. Multiplying the degrees of adjacent vertices in graph Ω provides the multiplicative first Zagreb index of a graph.
Sakander Hayat, Farwa Asmat
doaj +1 more source
Signed bicyclic graphs with minimal index
, 2022 Summary: The index \(\lambda_1(\Gamma)\) of a signed graph \(\Gamma=(G,\sigma)\) is just the largest eigenvalue of its adjacency matrix. For any \(n \geqslant 4\) we identify the signed graphs achieving the minimum index in the class of signed bicyclic graphs with \(n\) vertices.
Brunetti M., Ciampella A.
openaire +3 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
Vertex-colored graphs, bicycle spaces and Mahler measure [PDF]
Journal of Knot Theory and Its Ramifications, 2016 The space [Formula: see text] of conservative vertex colorings (over a field [Formula: see text]) of a countable, locally finite graph [Formula: see text] is introduced. When [Formula: see text] is connected, the subspace [Formula: see text] of based colorings is shown to be isomorphic to the bicycle space of the graph.
Lamey, Kalyn R. +2 more
openaire +4 more sources
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
Maximizing spectral radii of uniform hypergraphs with few edges
, 2015 In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic hypergraphs ...
Fan, Yi-Zheng +3 more
core +1 more source