Results 181 to 190 of about 207,710 (268)

Long Induced Paths in K s , s ${K}_{s,s}$‐Free Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT More than 40 years ago, Galvin, Rival, and Sands showed that every K s , s ${K}_{s,s}$‐free graph containing an n $n$‐vertex path must contain an induced path of length f ( n ) $f(n)$, where f ( n ) → ∞ $f(n)\to \infty $ as n → ∞ $n\to \infty $. Recently, it was shown by Duron, Esperet, and Raymond that one can take f ( n ) = ( log log n ) 1 /
Zach Hunter, Aleksa Milojević, Benny Sudakov, István Tomon   +3 more
wiley   +1 more source

The Ground-Set-Cost Budgeted Maximum Coverage Problem. [PDF]

Theory Comput Syst
van Heuven van Staereling I, de Keijzer B, Schäfer G.   +2 more
europepmc   +1 more source

On Oriented Colourings of Graphs on Surfaces

Journal of Graph Theory, EarlyView.
ABSTRACT For an oriented graph G $G$, the least number of colours required to oriented colour G $G$ is called the oriented chromatic number of G $G$ and denoted χ o ( G ) ${\chi }_{o}(G)$. For a non‐negative integer g $g$ let χ o ( g ) ${\chi }_{o}(g)$ be the least integer such that χ o ( G ) ≤ χ o ( g ) ${\chi }_{o}(G)\le \unicode{x0200A}{\chi }_{o}(g)
Alexander Clow
wiley   +1 more source

On a graph parameter related to vertex labelings and its application to minimum rank problems in graph theory

, 2019
Daniel Plaisted
openalex   +1 more source

Harary index of the zero divisor graph of upper triangular matrices. [PDF]

Sci Rep
Alshanqiti O, Sharma S, Bhat VK.
europepmc   +1 more source

Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces

Journal of Graph Theory, EarlyView.
ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) $G=(V,E)$ is said to be ( X , Y ) $(X,Y)$‐embeddable if any set of induced edge lengths from an ...
Sean Dewar, Eleftherios Kastis, Derek Kitson, William Sims   +3 more
wiley   +1 more source

ChemGraphX: an open-source web tool for computing topological indices and entropy measures. [PDF]

J Cheminform
Jacob K, Clement J, Arockiaraj M, Jindal A.   +3 more
europepmc   +1 more source

Signed Projective Cubes, a Homomorphism Point of View

Journal of Graph Theory, EarlyView.
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen, Reza Naserasr, Alessandra Sarti   +2 more
wiley   +1 more source

Network design for bypass roads using interval valued fuzzy outerplanar graphs. [PDF]

Sci Rep
Jaisankar D, Ramalingam S, Deivanayagampillai N, Walelign T.   +3 more
europepmc   +1 more source

Fractional Balanced Chromatic Number and Arboricity of Planar (Signed) Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A balanced ( p , q ) $(p,q)$‐coloring of a signed graph ( G , σ ) $(G,\sigma )$ is an assignment of q $q$ colors to each vertex of G $G$ from a platter of p $p$ colors, such that each color class induces a balanced set (a set that does not induce a negative cycle).
Reza Naserasr, Lan Anh Pham, Cyril Pujol, Huan Zhou   +3 more
wiley   +1 more source