Sequence graphs: characterization and counting of admissible elements

DOI10.1007/978-3-030-63072-0_17MaRDI QIDQ2056908zbMATH OpenOpenAlexFDO

Authors Sammy Khalife

Publication date 8 December 2021

Full work available at URL https://doi.org/10.1007/978-3-030-63072-0_17

zbMATH Keywords

graph representationpolynomial time algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)

Recommendations

• Characterizations and structure of sequential graphs.
• scientific article; zbMATH DE number 1051011
• Special sequences in weighted graphs
• Degree sequences of multigraphs
• scientific article; zbMATH DE number 4187870

Cites work

• scientific article; zbMATH DE number 3068971 (Why is no real title available?)
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• A strong-connectivity algorithm and its applications in data flow analysis
• Euclidean distance geometry and applications

Cited in

(2)

• Finding structure in sequences of real numbers via graph theory: a problem list
• On the structure property of PCR's adjacency graph with a prime order and its application of constructing M-sequences

This page was built for publication: Sequence graphs: characterization and counting of admissible elements

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