Results 191 to 200 of about 5,978,611 (274)

Obstructions for Homomorphisms to Odd Cycles in Series‐Parallel Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT For a graph H $H$, an H $H$‐colouring of a graph G $G$ is a vertex mapping ϕ : V ( G ) → V ( H ) $\phi :V(G)\to V(H)$ such that adjacent vertices are mapped to adjacent vertices. A graph G $G$ is C 2 k + 1 ${C}_{2k+1}$‐critical if G $G$ has no C 2 k + 1 ${C}_{2k+1}$‐colouring but every proper subgraph of G $G$ has a C 2 k + 1 ${C}_{2k+1 ...
Eun‐Kyung Cho, Ilkyoo Choi, Boram Park, Mark Siggers   +3 more
wiley   +1 more source

Degree-based Inverse Prodeg indices linking graph theory and cheminformatics with sharp results and QSPR modeling. [PDF]

Sci Rep
Alsharafi M, Zeren Y.
europepmc   +1 more source

A Note on Lovász Characterization of Perfect Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A graph is perfect if, for every induced subgraph, the chromatic number equals the size of its largest clique. In 1972, Lovász established a fundamental characterization of perfect graphs, showing that a graph is perfect if and only if, for every induced subgraph, the product of the size of the largest independent set and the size of the ...
James Alex
wiley   +1 more source

Structural identifiability in crystalline molecular networks using strong metric dimension. [PDF]

Sci Rep
Imran M, Salman M, Tahoor T, Ali F, Hasni R.   +4 more
europepmc   +1 more source

Characterization of Graphs Without Even F $F$‐Orientations

Journal of Graph Theory, EarlyView.
ABSTRACT A graph G $G$ is 1‐extendable if every edge belongs to at least one 1‐factor of G $G$. Let G $G$ be a graph with a 1‐factor F $F$. Then an even (odd) F $F$ ‐orientation of G $G$ is an orientation in which each F $F$‐alternating cycle has exactly an even (odd) number of edges directed in the same fixed direction around the cycle.
Marién Abreu, Domenico Labbate, Federico Romaniello, John Sheehan   +3 more
wiley   +1 more source

Quantum estimation with state symmetry-induced optimal measurements. [PDF]

Nat Commun
Liu JX, Shi HL, Wu C, Yu S.
europepmc   +1 more source

Two‐Block Paths in Oriented Graphs of Large Semidegree

Journal of Graph Theory, EarlyView.
ABSTRACT We study the existence of oriented paths with two blocks in oriented graphs under semidegree conditions. A block of an oriented path is a maximal directed subpath. Given positive integers k $k$ and ℓ $\ell $ with k / 2 ≤ ℓ < k $k/2\le \ell \lt k$, we establish a semidegree function that guarantees the containment of every oriented path with ...
Irena Penev, S Taruni, Stéphan Thomassé, Ana Trujillo‐Negrete, Mykhaylo Tyomkyn   +4 more
wiley   +1 more source

A general model for determination of molecular structures of anti-biofilm compounds through metric-based resolvability. [PDF]

Sci Rep
Alasmri A, Ali NMM, Ahmad A, Nadeem MF.
europepmc   +1 more source

On Graphs Which Have Locally Complete 2‐Edge‐colourings and Their Relationship to Proper Circular‐Arc Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A 2‐edge‐coloured graph G $G$ is called locally complete if for each vertex v $v$, the vertices adjacent to v $v$ through edges of the same colour induce a complete subgraph in G $G$. Locally complete 2‐edge‐coloured graphs have nice properties, and there exists a polynomial algorithm to decide whether such a graph has an alternating ...
Jørgen Bang‐Jensen, Jing Huang
wiley   +1 more source

Multi-criteria decision analysis of dendrimer applications in drug delivery systems. [PDF]

Eur Phys J E Soft Matter
Bibi Z, Ghafar MS, Ali Y, Imran M, Shang Y.   +4 more
europepmc   +1 more source