Akbari et al.’s edge-path matrix Conjectures 1 and 2
Statement
Let be a graph of order , and let be its edge-path matrix, where is the maximum number of pairwise edge-disjoint paths between distinct vertices and , and . Conjecture 1. For every positive integer , if for all , then . Conjecture 2. The graph is Eulerian if and only if every entry of is even; that is, is Eulerian if and only if for all .
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.