Results 21 to 29 of about 704 (29)

Strong geodetic number of complete bipartite graphs, crown graphs and hypercubes

, 2018
The strong geodetic number, $\text{sg}(G),$ of a graph $G$ is the smallest number of vertices such that by fixing one geodesic between each pair of selected vertices, all vertices of the graph are covered.
Gledel, Valentin, Iršič, Vesna
core  

NUMERICAL INTEGRATION ON GRAPHS: WHERE TO SAMPLE AND HOW TO WEIGH. [PDF]

Math Comput, 2020
Linderman GC, Steinerberger S.
europepmc   +1 more source

Andronov-Hopf and Neimark-Sacker bifurcations in time-delay differential equations and difference equations with applications to models for diseases and animal populations. [PDF]

Adv Differ Equ, 2020
Darlai R, Moore EJ, Koonprasert S.
europepmc   +1 more source

On Properties of Distance-Based Entropies on Fullerene Graphs. [PDF]

Entropy (Basel), 2019
Ghorbani M, Dehmer M, Rajabi-Parsa M, Mowshowitz A, Emmert-Streib F.   +4 more
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

Applications of magnesium iodide structure via modified-polynomials. [PDF]

Sci Rep
Ghazwani H, Jamil MK, Ahmad A, Azeem M, Koam ANA.   +4 more
europepmc   +1 more source

Rigidity of Symmetric Frameworks on the Cylinder. [PDF]

Discrete Comput Geom
Nixon A, Schulze B, Wall J.
europepmc   +1 more source

Diverse collections in matroids and graphs. [PDF]

Math Program
Fomin FV, Golovach PA, Panolan F, Philip G, Saurabh S.   +4 more
europepmc   +1 more source