On the Number of Paths of Lengths 3 and 4 in a Graph

International Journal of Applied Mathematical Research

doi 10.14419/ijamr.v3i2.2409

Full Text

Abstract

Available in

Date

Authors

Publisher

Science Publishing Corporation

Related search

Every Planar Graph Without Cycles of Lengths 4 to 12 Is Acyclically 3-Choosable

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2009English

On Problems Concerning Paths in a Graph

Engineering Journal: Science and Innovation
2013English

On the Number of Crossings in a Complete Graph

Proceedings of the Edinburgh Mathematical Society
Mathematics
1963English

On the Representation Number of a Crown Graph

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

The All-Paths Transit Function of a Graph

Czechoslovak Mathematical Journal
Mathematics
2001English

Upper Bounds on the Bondage Number of a Graph

Electronic Journal of Graph Theory and Applications
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

A Note on Nonsplitdomination Number of a Graph

IOSR Journal of Mathematics
2017English

Some New Results on the Number of Paths

Open Journal of Modelling and Simulation
2015English

A Lower Bound on the Number of Vertices of a Graph

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1978English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy