The following pages link to Parallel concepts in graph theory (Q1324287):
Displaying 50 items.
- Two topics in tree inference: locating a phonological network effect in immediate recall and arborescence partitive set form (Q285951) (← links)
- The recognition of geodetically connected graphs (Q293190) (← links)
- Breaking symmetry in complete graphs by orienting edges: asymptotic bounds (Q293364) (← links)
- Path-based depth-first search for strong and biconnected components (Q294748) (← links)
- Finding and counting small induced subgraphs efficiently (Q294749) (← links)
- Recognizing cographs and threshold graphs through a classification of their edges (Q294753) (← links)
- On graphs whose graphoidal domination number is one (Q321997) (← links)
- Radio mean labeling of a graph (Q322022) (← links)
- The forcing vertex detour monophonic number of a graph (Q322058) (← links)
- Zero ring labeling of graphs (Q324913) (← links)
- \(k\)-Zumkeller labeling for twig graphs (Q324928) (← links)
- Odd mean labeling of chain of graphs (Q324943) (← links)
- Further results on vertex equitable graphs (Q324945) (← links)
- Odd harmonious labeling of some new families of graphs (Q324947) (← links)
- Some results on edge pair sum labeling (Q324950) (← links)
- Finite abelian group labeling (Q324975) (← links)
- Intersection graphs of cyclic subgroups of groups (Q327613) (← links)
- Constructions of 1-uniform dcsl graphs using well-graded families of sets (Q327617) (← links)
- Bounds on graphoidal length of a graph (Q327633) (← links)
- Changing and unchanging in \(m\)-eternal total domination in graphs (Q327647) (← links)
- Radio secure number of a graph (Q327660) (← links)
- Upper detour monophonic number of a graph (Q327673) (← links)
- Absorption Cayley graph (Q327687) (← links)
- On the Laplacian spectra of some variants of corona (Q332631) (← links)
- Vertex coloring of graphs with few obstructions (Q344868) (← links)
- A sufficient condition for the existence of an anti-directed 2-factor in a directed graph (Q409370) (← links)
- Minimal strong digraphs (Q409422) (← links)
- A generalization of Boesch's theorem (Q409456) (← links)
- Locally bounded coverings and factorial properties of graphs (Q412246) (← links)
- Exact \(\lambda\)-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips (Q412338) (← links)
- Optimal broadcasting for locally twisted cubes (Q413259) (← links)
- On switching classes, NLC-width, cliquewidth and treewidth (Q418754) (← links)
- Bipolar fuzzy graphs (Q424788) (← links)
- On 3-connected Hamiltonian line graphs (Q427827) (← links)
- On the existence of \(k\)-sun systems (Q427839) (← links)
- On the zero divisor graphs of \(pm\)-lattices (Q427873) (← links)
- The walk distances in graphs (Q427888) (← links)
- Vertex coloring without large polychromatic stars (Q432703) (← links)
- Links between two semisymmetric graphs on 112 vertices via association schemes (Q432745) (← links)
- Backup 2-center on interval graphs (Q442280) (← links)
- \(E\)-super vertex magic labelings of graphs (Q444442) (← links)
- The spectrum and the signless Laplacian spectrum of coronae (Q445830) (← links)
- Edge covering pseudo-outerplanar graphs with forests (Q449118) (← links)
- Turing-Hopf instability in biochemical reaction networks arising from pairs of subnetworks (Q452456) (← links)
- Computation of isotopisms of algebras over finite fields by means of graph invariants (Q507895) (← links)
- Interval edge-colorings of composition of graphs (Q516842) (← links)
- On the Laplacian coefficients of unicyclic graphs with prescribed matching number (Q533757) (← links)
- Interval-valued fuzzy graphs (Q534970) (← links)
- Some special minimum \(k\)-geodetically connected graphs (Q548276) (← links)
- The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs (Q548395) (← links)
