Nonderogatory directed webgraph

DOI10.1155/2013/237948MaRDI QIDQ352540zbMATH OpenOpenAlexWikidataFDO

Authors İlhan Hacıoğlu, Selman Bayat, Ozkan Yilmaz, Oktay Cesur

Publication date 5 July 2013

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2013/237948

zbMATH Keywords

adjacency matrixCartesian productcharacterictic polynomialdicycledifansdipathdiwebgraphdiwheelsladder graphsminimal polynomialnonderogatory digraphvertex labeled digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Review text

Summary: By assigning a certain direction to the webgraphs, which are defined as the Cartesian product of cycles and paths, we prove that they are nonderogatory.

Recommendations

• scientific article; zbMATH DE number 1875439
• A general model of web graphs
• Hypernetworks in a directed hypergraph
• The directed multigraph n-dm
• On weighted directed graphs
• Dynamics of directed graphs: The world-wide Web
• Directed hypergraphs and applications
• scientific article; zbMATH DE number 1629951
• Directed scale-free graphs
• scientific article; zbMATH DE number 887760

Cites work

• scientific article; zbMATH DE number 1824256 (Why is no real title available?)
• scientific article; zbMATH DE number 3839766 (Why is no real title available?)
• Nonderogatory directed windmills
• Nonderogatory unicyclic digraphs
• The characteristic polynomial of ladder digraph and an annihilating uniqueness theorem
• The complete product of annihilatingly unique digraphs

This page was built for publication: Nonderogatory directed webgraph

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