Results 61 to 70 of about 3,533,009 (320)
-shaped point set embeddings of high-degree plane graphs
AKCE 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
Electronic 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
Graph Abstraction and Abstract Graph Transformation [PDF]
, 2007 Many important systems like concurrent heap-manipulating programs, communication networks, or distributed algorithms are hard to verify due to their inherent dynamics and unboundedness.
Bauer, J. +3 more
core +1 more source
FEBS Letters, EarlyView.This study reveals how prime editing guide RNA (pegRNA) secondary structure and reverse transcriptase template length affect prime editing efficiency in correcting the phospholamban R14del cardiomyopathy‐associated mutation. Insights support the design of structurally optimized enhanced pegRNAs for precise gene therapy.
Bing Yao +7 more
wiley +1 more source
Comparability graphs and intersection graphs
Discrete Mathematics, 1983 AbstractA function diagram (f-diagram) D consists of the family of curves {1̵ñ} obtained from n continuous functions fi:[0,1]→R(1⩽i⩽n). We call the intersection graph of D a function graph (f-graph). It is shown that a graph G is an f-graph if and only if its complement Ḡ is a comparability graph.
Martin Charles Golumbic +2 more
openaire +2 more sources
The Minimal Perimeter of a Log-Concave Function
Mathematics, 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
On sub-class sizes of mutually permutable products
Open 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
Graphs isomorphic to their path graphs [PDF]
Mathematica Bohemica, 2002 Summary: We prove that for every number \(n\geq 1\), the \(n\)-iterated \(P_3\)-path graph of \(G\) is isomorphic to \(G\) if and only if \(G\) is a collection of cycles, each of length at least 4. Hence, \(G\) is isomorphic to \(P_3(G)\) if and only if \(G\) is a collection of cycles, each of length at least 4.
Mathematica Bohemica, Martin Knor
openaire +1 more source
The Determinant of Matching Matrix in the Evaluation of Matching Polynomial
Revista 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
Graph properties, graph limits and entropy [PDF]
, 2013 We study the relation between the growth rate of a graph property and the entropy of the graph limits that arise from graphs with that property. In particular, for hereditary classes we obtain a new description of the colouring number, which by well ...
Hatami, Hamed +2 more
core +1 more source