Some inner metric parameters of a digraph: iterated line digraphs and integer sequences

DOI10.1007/s40590-024-00691-8MaRDI QIDQ6655972

Could not fetch data.

Publication date: 27 December 2024

Published in: Boletín de la Sociedad Matemática Mexicana. Third Series (Search for Journal in Brave)

zbMATH Keywords

eccentricityline digraphKautz digraphinteger sequenceDe Bruijn digraphinner diameter

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Automata and forbidden words
• Some properties of line digraphs
• Iterated line digraphs are asymptotically dense
• The spectra of subKautz and cyclic Kautz digraphs
• On the linegraph of a directed-graph
• Construction Techniques for Digraphs with Minimum Diameter
• Line Digraph Iterations and the (d, k) Digraph Problem
• The diameter of cyclic Kautz digraphs
• The (Delta,D) and (Delta,N) problems in double-step digraphs with unilateral distance
• A Note on the Order of Iterated Line Digraphs
• The Polynomial of a Directed Graph
• Digraphs
• A survey of line digraphs and generalizations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Some inner metric parameters of a digraph: iterated line digraphs and integer sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655972)