Results 61 to 70 of about 2,125,479 (331)

-shaped point set embeddings of high-degree plane graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
A point set embedding of a given plane graph on a given point set on a plane is a drawing of where each vertex is drawn on a point in . An orthogonal point set embedding of a plane graph is a point set embedding of such that each edge is drawn as a ...
Shaheena Sultana, Md. Saidur Rahman
doaj   +1 more source

The consecutively super edge-magic deficiency of graphs and related concepts

open access: yesElectronic Journal of Graph Theory and Applications, 2020
A bipartite graph G with partite sets X and Y is called consecutively super edge-magic if there exists a bijective function f : V(G) ⋃ E(G) → {1,2,...,|V(G)| + |E(G)|} with the property that f(X) = {1,2,...,|X|}, f(Y) = {|X|+1, |X|+2,...,|V(G)|} and f(u)+
Rikio Ichishima   +2 more
doaj   +1 more source

On sub-class sizes of mutually permutable products

open access: yesOpen Mathematics, 2021
In this paper, we investigate the influence of sub-class sizes on a mutually permutable factorized group in which the sub-class sizes of some elements of its factors have certain quantitative properties. Some criteria for a group to be pp-nilpotent or pp-
Li Jinbao, Yang Yong
doaj   +1 more source

Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10

open access: yesFEBS Letters, EarlyView.
Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang   +8 more
wiley   +1 more source

The Minimal Perimeter of a Log-Concave Function

open access: yesMathematics, 2020
Inspired by the equivalence between isoperimetric inequality and Sobolev inequality, we provide a new connection between geometry and analysis. We define the minimal perimeter of a log-concave function and establish a characteristic theorem of this ...
Niufa Fang, Zengle Zhang
doaj   +1 more source

Learning Entity and Relation Embeddings for Knowledge Graph Completion

open access: yesAAAI Conference on Artificial Intelligence, 2015
Knowledge graph completion aims to perform link prediction between entities. In this paper, we consider the approach of knowledge graph embeddings.
Yankai Lin   +4 more
semanticscholar   +1 more source

Embedding Graphs into Embedded Graphs [PDF]

open access: yesAlgorithmica, 2020
A (possibly denerate) drawing of a graph $G$ in the plane is approximable by an embedding if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph $G$ in the plane is approximable by an embedding, can be carried out in polynomial time, if a desired embedding of ...
openaire   +4 more sources

Biclique Graphs of K3-free Graphs and Bipartite Graphs

open access: yesProcedia Computer Science, 2021
A biclique of a graph is a maximal complete bipartite subgraph. The biclique graph of a graph $G$, $KB(G)$, defined as the intersection graph of the bicliques of $G$, was introduced and characterized in 2010. However, this characterization does not lead to polynomial time recognition algorithms.
Groshaus, Marina   +1 more
openaire   +2 more sources

Time after time – circadian clocks through the lens of oscillator theory

open access: yesFEBS Letters, EarlyView.
Oscillator theory bridges physics and circadian biology. Damped oscillators require external drivers, while limit cycles emerge from delayed feedback and nonlinearities. Coupling enables tissue‐level coherence, and entrainment aligns internal clocks with environmental cues.
Marta del Olmo   +2 more
wiley   +1 more source

The Determinant of Matching Matrix in the Evaluation of Matching Polynomial

open access: yesRevista de Matemática: Teoría y Aplicaciones, 2011
A characterization is given for graphs whose matching polynomial is the determinant of their matching matrices. The matching matrix is then modified and its relation with other graph polynomials is examined.
Shanaz A. Wahid
doaj   +1 more source

Home - About - Disclaimer - Privacy