Graph theory with applications
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On the multiplicative sum Zagreb index of molecular graphs
- Light subgraphs in the family of 1-planar graphs with high minimum degree
- Some sufficient conditions for graphs to have (g, f)-factors
- On the Hamiltonian index
- Fault-Tolerant Panconnectivity of Augmented Cubes AQn
- Long paths and cycles passing through specified vertices under the average degree condition
- On hamiltonian line graphs
- Disjoint (s, t)‐cuts in a network
- Cycles in triangle-free graphs
- scientific article; zbMATH DE number 7077334 (Why is no real title available?)
- Regular subgraphs of almost regular graphs
- On the \(D(2)\)-vertex distinguishing total coloring of graphs with \(\Delta=3\)
- Vertex-fault-tolerant cycles embedding on enhanced hypercube networks
- List total coloring of pseudo-outerplanar graphs
- The maximum Perron roots of digraphs with some given parameters
- Prescribed matchings extend to Hamiltonian cycles in hypercubes with faulty edges
- Some inverse optimization problems on network
- Supereulerian graphs: A survey
- Disjoint directed cycles with specified lengths in directed bipartite graphs
- Two sufficient conditions for a 2-factor in a bipartite graph
- The total interval number of a graph
- Differential in complementary prisms
- Chromatic connected domination in graphs
- An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs
- On \(K_{1,k}\)-factorizations of a complete bipartite graph
- Decomposing graphs into paths of fixed length
- A generalization of commuting graphs
- Broadcast and gossip in line-communication mode
- Half-transitive graphs of valency 4 with prescribed attachment numbers
- A note on \(n\)-edge chromatic number
- On one of Graffiti's conjectures (583)
- The genus of the balanced hypercube
- Networks beyond pairwise interactions: structure and dynamics
- Total induced vertex stress in barbell-like graphs
- Existence of solution to a model for gas transportation networks on non-flat topography
- Factorizations of regular graphs
- On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
- A lower bound on the total signed domination numbers of graphs
- On the A_ spectral radius of digraphs with given parameters
- On resolvable multipartite \(G\)-designs. II
- AVDTC numbers of generalized Halin graphs with maximum degree at least 6
- Spectral radius and signless Laplacian spectral radius of strongly connected digraphs
- The inertia and energy of the distance matrix of a connected graph
- The connection between evolution algebras, random walks and graphs
- On monophonic position sets in graphs
- scientific article; zbMATH DE number 7034923 (Why is no real title available?)
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
- Nowhere‐zero 3‐flows in products of graphs
- A graph associated to centralizer of elements of a group
- The minimality of the Georges-Kelmans graph
- Integer programming formulations for the two 4-hop-constrained paths problem
- A note on the interpretation of the efficiency centrality
- Graph theory: modeling, applications, and algorithms
- Vertex and edge Padmakar-Ivan indices of unitary Cayley graphs
- Rainbow faces in edge-colored plane graphs
- A note on matchings and spanning trees with bounded degrees
- Cycle multiplicity of some total graphs
- Spectral properties of Pascal graphs
- Coincidence points and common fixed points for hybrid pair of mappings in \(b\)-metric spaces endowed with a graph
- Sudoku number of graphs
- New comments on ``A Hamilton sufficient condition for completely independent spanning tree
- Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems
- Oriented hamilton cycles in digraphs
- On the spectrum of an equitable quotient matrix and its application
- Comparison between Merrifield-Simmons index and Wiener index of graphs
- Disjoint paths, planarizing cycles, and spanning walks
- The calculations of topological indices on certain networks
- scientific article; zbMATH DE number 6914816 (Why is no real title available?)
- Hamiltonicity of 2-connected quasi-claw-free graphs
- Degree‐bounded coloring of graphs: Variations on a theme by brooks
- On tetravalent vertex-transitive bi-circulants
- Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on \(k\) vertices
- Neighbor sum distinguishing total coloring of triangle free IC-planar graphs
- Symmetrically connected and antisymmetrically connected \(T_0\)-quasi-metric extensions
- \(K_{1,k}\)-factorization of bipartite graphs
- Some new coincidence point results for single-valued and multi-valued mappings in \(b\)-metric spaces via digraphs
- Spanning 5-ended trees in \(K_{1,5}\)-free graphs
- An integer program for positive semidefinite zero forcing in graphs
- The diameters of almost all Cayley digraphs
- A note on the smallest connected non-traceable cubic bipartite planar graph
- Unipancyclic matroids
- Topological properties of a 3-regular small world network
- Sudoku strategies using graph theory
- Vulnerability of super connected split graphs and bisplit graphs
- The numbers of dependent \(k\)-sets in a graph are log concave
- Hamiltonicity of 4-connected graphs
- Sports tournaments, home-away assignments, and the break minimization problem
- Symmetric bimonoidal intermuting categories and \(\omega\times\omega\) reduced bar constructions
- Upper bounds on the chromatic polynomial of a connected graph with fixed clique number
- Isolated scattering number can be computed in polynomial time for interval graphs
- Three tree-paths
- Pursuit—Evasion games on graphs
- Some conditions for the existence off-factors
- A graph related to the Euler function
- An efficient feature selection algorithm based on the description vector and hypergraph
- On an Invariant of Graphs and the Reliability Polynomial
- Equitable cluster partition of graphs with small maximum average degree
- On the chromatic edge stability index of graphs
- 2-Trees: Structural insights and the study of Hamiltonian paths
- Extremal numbers of leaves for trees with fixed diameter and maximum degree
This page was built for publication: Graph theory with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3097395)
