Results 61 to 70 of about 1,804,356 (287)

Twins: non-isomorphic models forced to be isomorphic Part I

open access: yesMonatshefte für Mathematik
Abstract For which (first-order complete, usually countable) T do there exist non-isomorphic models of T which become isomorphic after forcing with a forcing notion $$\
openaire   +2 more sources

Complexity reduction by symmetry: Uncovering the minimal regulatory network for logical computation in bacteria.

open access: yesPLoS Computational Biology
Symmetry principles play an important role in geometry, and physics, allowing for the reduction of complicated systems to simpler, more comprehensible models that preserve the system's features of interest. Biological systems are often highly complex and
Luis A Álvarez-García   +3 more
doaj   +1 more source

Partitioning into Isomorphic or Connected Subgraphs [PDF]

open access: yes, 2019
This thesis deals mainly with the partitioning and connectedness of graphs. First, we show that the problem of partitioning the nodes of a graph into a specific number of subsets such that the induced subgraphs on these sets are isomorphic to one another
Lüthen, Hendrik
core  

Low‐Pressure CO2 and Aromatic Recognition by Interlayer Adaptive Crystal of π‐Hole‐Functionalized Zn(II) Coordination Sheets

open access: yesAngewandte Chemie International Edition, EarlyView.
A perfluorinated Zn(II) coordination sheet operates as an interlayer adaptive crystal (LAC), where a small ultramicropore acts as an electrostatic trigger. Guest‐induced breathing driven by fluorinated π‐hole surfaces enables highly selective inclusion of CO2 over N2 and CH4, and benzene over other six‐membered hydrocarbons, beyond the intrinsic ...
Masahiro Abe   +5 more
wiley   +1 more source

Non-Isomorphic Cayley Graphs of Metacyclic Groups of Order 8p with the Same Spectrum

open access: yesMathematics
The spectrum of a graph Γ, denoted by Spec(Γ), is the multiset of eigenvalues of its adjacency matrix. A Cayley graph Cay(G,S) of a finite group G is called Cay-DS (Cayley graph determined by its spectrum) if, for any other Cayley graph Cay(G,T), Spec ...
Lang Tang, Weijun Liu, Rongrong Lu
doaj   +1 more source

Isomorphic Subgraphs

open access: yes, 1999
We are interested in finding symmetries in graphs and then use these symmetries for graph drawing algorithms. There are two general approaches to this problem, the first one is known as GEOMETRIC SYMMETRIES on the basis of drawings, the other rests upon
Sabine Bachl, Bachl, Sabine
core   +1 more source

Isomorphic JavaScript and MeteorJS [PDF]

open access: yes, 2017
This study was written to give a brief introduction of isomorphic JavaScript and MeteorJS platform. First, the basic concept of isomorphic JavaScript and how it is revolutionizing modern web applications is explained.
Ashraf, Waqar
core  

On the distance eigenvalues of Cayley graphs

open access: yesپژوهش‌های ریاضی, 2022
In this paper, graphs are undirected and loop-free and groups are finite. By Cn, Kn and Km,n we mean the cycle graph with n vertices, the complete graph with n vertices and the complete bipartite graph with parts size m and n, respectively.
Majid Arezoomand
doaj  

A study on Type-2 isomorphic circulant graphs. PART 9: Computer programs to show Type-1 $\&$ -2 isomorphic circulant graphs

open access: yes
Elspas and Turner \cite{eltu} raised a question on the isomorphism of $C_{16}(1,3,7)$ and $C_{16}(2,3,5)$ and Vilfred \cite{v96} gave its answer by defining Type-2 isomorphism of $C_n(R)$ w.r.t. $m$ $\ni$ $m$ = $\gcd(n, r) > 1$, $r\in R$ and $r,n\in\mathbb{N}$ and studied such graphs for $m$ = 2 in \cite{v13,v20}.
Kamalappan, Vilfred, Peraprakash, Wilson
openaire   +2 more sources

On Isomorphism Classes and Invariants of Low Dimensional Complex Filiform Leibniz Algebras (PART 1)

open access: yes, 2007
The paper aims to investigate the classification problem of low dimensional complex none Lie filiform Leibniz algebras. There are two sources to get classification of filiform Leibniz algebras. The first of them is the naturally graded none Lie filiform Leibniz algebras and the another one is the naturally graded filiform Lie algebras.
Rakhimov, I. S., Husain, S. K. Said
openaire   +2 more sources

Home - About - Disclaimer - Privacy