Algebraic structure of graph operations in terms of degree sequences
From MaRDI portal
(Redirected from Publication:4627889)
Recommendations
Cites work
- A simple criterion on degree sequences of graphs
- Contributions to the theory of graphic sequences
- Degree sequences of random graphs
- Graphs and degree sequences. I
- Graphs and degree sequences: Canonical decomposition
- On the first Zagreb index and multiplicative Zagreb coindices of graphs
- Parallel enumeration of degree sequences of simple graphs. II
- Reduced criteria for degree sequences
- The multiplicative Zagreb indices of graph operations
Cited in
(12)- The sigma coindex of graph operations
- On structure of discrete Muckenhoupt and discrete Gehring classes
- Independence number of graphs and line graphs of trees by means of omega invariant
- Degree sequence of graph operator for some standard graphs
- Degree sequences of join and corona products of graphs
- Local dissymmetry on graphs and related algebraic structures
- Weak separation axioms via almost-ID-sets
- Some classifications of graphs with respect to a set adjacency relation
- S-corona operations of standard graphs in terms of degree sequences
- Double Roman domination in some graphs
- Unveiling scale-free networks through exploring the graph theoretic properties from prime squared Jordan totient function
- On the topological indices and graph operation
This page was built for publication: Algebraic structure of graph operations in terms of degree sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4627889)