Results 81 to 90 of about 1,119 (95)

LIMITING PROBABILITY TRANSITION MATRIX OF A CONDENSED FIBONACCI TREE

, 2018
K. A. Germina
semanticscholar   +1 more source

Algebraic invariants of the edge ideals of whisker graphs of cubic circulant graphs. [PDF]

Heliyon
Afridi MUK, Rehman IU, Ishaq M.
europepmc   +1 more source

EXTREME VALUES OF THE FIEDLER VECTOR ON TREES. [PDF]

Linear Algebra Appl
Lederman RR, Steinerberger S.
europepmc   +1 more source

A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups. [PDF]

Math Ann
Gollin JP, Hendrey K, Kwon OJ, Oum SI, Yoo Y.   +4 more
europepmc   +1 more source

Twisted Ways to Find Plane Structures in Simple Drawings of Complete Graphs. [PDF]

Discrete Comput Geom
Aichholzer O, García A, Tejel J, Vogtenhuber B, Weinberger A.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Maximum Size of C≤ k-Free Strong Digraphs with Out-Degree at Least Two

Social Science Research Network, 2022
: Let H be a family of digraphs. A digraph D is H -free if it contains no isomorphic copy of any member of H . For k ≥ 2, we set C ≤ k = { C 2 , C 3 , . . . , C k } , where C (cid:96) is a directed cycle of length (cid:96) ∈ { 2 , 3 , . . . , k } . Let D
Bin Chen, Xinmin Hou
semanticscholar   +1 more source

Triangular index of some graph products

Applied Mathematical Sciences, 2021
The number of triangles in a graph G is called the triangular index of G, denoted by Ti(G). In this paper we give the exact expressions for the triangular indices of the complete product G ∨ H, corona product G ◦ H, cartesian product G H, and tensor ...
Remarl Joseph M. Damalerio, R. Eballe
semanticscholar   +1 more source

On the Pendant Number of Some New Graph Classes

Research & Reviews: Discrete Mathematical Structures, 2019
A decomposition of a graph  is a collection of its edge disjoint sub-graphs such that their union is . If all the sub-graphs in the decomposition are paths, then it is a path decomposition. In this paper, we discuss the pendant number, the minimum number
J. Sebastian, J. V. Kureethara, S. Naduvath, C. Dominic   +3 more
semanticscholar   +1 more source

Multiple Amalgamated Free Products and Multiple Free Products with Commuting Subgroups by Trees

International Journal of Applied Mathematics
We define multiple amalgamated free product of groupsand multiple free product of groups with commuting subgroups and we prove that when a group G acts on a tree Γ such that the quotient graph G/Γ is pathn−1, G maybe identified with the free product of n
S. Douboula
semanticscholar   +1 more source

Forbidden Subgraphs for Hamiltonicity of 3‐Connected Claw‐Free Graphs

Journal of Graph Theory, 2013
J. Fujisawa
semanticscholar   +1 more source