Добірка наукової літератури з теми "THEORY OF SIGNED GRAPHS"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "THEORY OF SIGNED GRAPHS".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "THEORY OF SIGNED GRAPHS"
Hou, Yaoping, and Dijian Wang. "Laplacian integral subcubic signed graphs." Electronic Journal of Linear Algebra 37 (February 26, 2021): 163–76. http://dx.doi.org/10.13001/ela.2021.5699.
Повний текст джерелаBelardo, Francesco, and Maurizio Brunetti. "Connected signed graphs L-cospectral to signed ∞-graphs." Linear and Multilinear Algebra 67, no. 12 (July 9, 2018): 2410–26. http://dx.doi.org/10.1080/03081087.2018.1494122.
Повний текст джерелаLi, Yu, Meng Qu, Jian Tang, and Yi Chang. "Signed Laplacian Graph Neural Networks." Proceedings of the AAAI Conference on Artificial Intelligence 37, no. 4 (June 26, 2023): 4444–52. http://dx.doi.org/10.1609/aaai.v37i4.25565.
Повний текст джерелаZhang, Xianhang, Hanchen Wang, Jianke Yu, Chen Chen, Xiaoyang Wang, and Wenjie Zhang. "Polarity-based graph neural network for sign prediction in signed bipartite graphs." World Wide Web 25, no. 2 (February 16, 2022): 471–87. http://dx.doi.org/10.1007/s11280-022-01015-4.
Повний текст джерелаTupper, Melissa, and Jacob A. White. "Online list coloring for signed graphs." Algebra and Discrete Mathematics 33, no. 2 (2022): 151–72. http://dx.doi.org/10.12958/adm1806.
Повний текст джерелаDIAO, Y., G. HETYEI, and K. HINSON. "TUTTE POLYNOMIALS OF TENSOR PRODUCTS OF SIGNED GRAPHS AND THEIR APPLICATIONS IN KNOT THEORY." Journal of Knot Theory and Its Ramifications 18, no. 05 (May 2009): 561–89. http://dx.doi.org/10.1142/s0218216509007075.
Повний текст джерелаHameed, Shahul K., T. V. Shijin, P. Soorya, K. A. Germina, and Thomas Zaslavsky. "Signed distance in signed graphs." Linear Algebra and its Applications 608 (January 2021): 236–47. http://dx.doi.org/10.1016/j.laa.2020.08.024.
Повний текст джерелаAcharya, B. D. "Signed intersection graphs." Journal of Discrete Mathematical Sciences and Cryptography 13, no. 6 (December 2010): 553–69. http://dx.doi.org/10.1080/09720529.2010.10698314.
Повний текст джерелаLi, Shu, and Jianfeng Wang. "Yet More Elementary Proof of Matrix-Tree Theorem for Signed Graphs." Algebra Colloquium 30, no. 03 (August 29, 2023): 493–502. http://dx.doi.org/10.1142/s1005386723000408.
Повний текст джерелаBrown, John, Chris Godsil, Devlin Mallory, Abigail Raz, and Christino Tamon. "Perfect state transfer on signed graphs." Quantum Information and Computation 13, no. 5&6 (May 2013): 511–30. http://dx.doi.org/10.26421/qic13.5-6-10.
Повний текст джерелаДисертації з теми "THEORY OF SIGNED GRAPHS"
Bowlin, Garry. "Maximum frustration of bipartite signed graphs." Diss., Online access via UMI:, 2009.
Знайти повний текст джерелаWang, Jue. "Algebraic structures of signed graphs /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?MATH%202007%20WANG.
Повний текст джерелаSen, Sagnik. "A contribution to the theory of graph homomorphisms and colorings." Phd thesis, Bordeaux, 2014. http://tel.archives-ouvertes.fr/tel-00960893.
Повний текст джерелаSivaraman, Vaidyanathan. "Some Topics concerning Graphs, Signed Graphs and Matroids." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1354645035.
Повний текст джерелаSun, Qiang. "A contribution to the theory of (signed) graph homomorphism bound and Hamiltonicity." Thesis, Université Paris-Saclay (ComUE), 2016. http://www.theses.fr/2016SACLS109/document.
Повний текст джерелаIn this thesis, we study two main problems in graph theory: homomorphism problem of planar (signed) graphs and Hamiltonian cycle problem.As an extension of the Four-Color Theorem, it is conjectured ([80],[41]) that every planar consistent signed graph of unbalanced-girth d+1(d>1) admits a homomorphism to signed projective cube SPC(d) of dimension d. It is naturally asked that:Is SPC(d) an optimal bound of unbalanced-girth d+1 for all planar consistent signed graphs of unbalanced-girth d+1?In Chapter 2, we prove that: if (B,Ω) is a consistent signed graph of unbalanced-girth d which bounds the class of consistent signed planar graphs of unbalanced-girth d, then |B|≥2^{d-1}. Furthermore,if no subgraph of (B,Ω) bounds the same class, δ(B)≥d, and therefore,|E(B)|≥d·2^{d-2}.Our result shows that if the conjecture above holds, then the SPC(d) is an optimal bound both in terms of number of vertices and number of edges.When d=2k, the problem is equivalent to the homomorphisms of graphs: isPC(2k) an optimal bound of odd-girth 2k+1 for P_{2k+1}(the class of all planar graphs of odd-girth at least 2k+1)? Note that K_4-minor free graphs are planar graphs, is PC(2k) also an optimal bound of odd-girth 2k+1 for all K_4-minor free graphs of odd-girth 2k+1 ? The answer is negative, in [6], a family of graphs of order O(k^2) bounding the K_4-minor free graphs of odd-girth 2k+1 were given. Is this an optimal bound? In Chapter 3, we prove that: if B is a graph of odd-girth 2k+1 which bounds all the K_4-minor free graphs of odd-girth 2k+1,then |B|≥(k+1)(k+2)/2. Our result together with the result in [6] shows that order O(k^2) is optimal.Furthermore, if PC(2k) bounds P_{2k+1},then PC(2k) also bounds P_{2r+1}(r>k). However, in this case we believe that a proper subgraph of PC(2k) would suffice to bound P_{2r+1}, then what’s the optimal subgraph of PC(2k) that bounds P_{2r+1}? The first case of this problem which is not studied is k=3 and r=5. For this case, Naserasr [81] conjectured that the Coxeter graph bounds P_{11} . Supporting this conjecture, in Chapter 4, we prove that the Coxeter graph bounds P_{17}.In Chapter 5,6, we study the Hamiltonian cycle problems. Dirac showed in 1952that every graph of order n is Hamiltonian if any vertex is of degree at least n/2. This result started a new approach to develop sufficient conditions on degrees for a graph to be Hamiltonian. Many results have been obtained in generalization of Dirac’s theorem. In the results to strengthen Dirac’s theorem, there is an interesting research area: to control the placement of a set of vertices on a Hamiltonian cycle such that thesevertices have some certain distances among them on the Hamiltonian cycle.In this thesis, we consider two related conjectures, one is given by Enomoto: if G is a graph of order n≥3, and δ(G)≥n/2+1, then for any pair of vertices x, y in G, there is a Hamiltonian cycle C of G such that dist_C(x, y)=n/2. Motivated by this conjecture, it is proved,in [32],that a pair of vertices are located at distances no more than n/6 on a Hamiltonian cycle. In [33], the cases δ(G) ≥(n+k)/2 are considered, it is proved that a pair of vertices can be located at any given distance from 2 to k on a Hamiltonian cycle. Moreover, Faudree and Li proposed a more general conjecture: if G is a graph of order n≥3, and δ(G)≥n/2+1, then for any pair of vertices x, y in G andany integer 2≤k≤n/2, there is a Hamiltonian cycle C of G such that dist_C(x, y) = k. Using Regularity Lemma and Blow-up Lemma, in Chapter 5, we give a proof ofEnomoto’s conjecture for graphs of sufficiently large order, and in Chapter 6, we give a proof of Faudree and Li’s conjecture for graphs of sufficiently large order
Kotzagiannidis, Madeleine S. "From spline wavelet to sampling theory on circulant graphs and beyond : conceiving sparsity in graph signal processing." Thesis, Imperial College London, 2017. http://hdl.handle.net/10044/1/56614.
Повний текст джерелаLucas, Claire. "Trois essais sur les relations entre les invariants structuraux des graphes et le spectre du Laplacien sans signe." Phd thesis, Ecole Polytechnique X, 2013. http://pastel.archives-ouvertes.fr/pastel-00956183.
Повний текст джерелаMutar, Mohammed A. "Hamiltonicity in Bidirected Signed Graphs and Ramsey Signed Numbers." Wright State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=wright1513377549200572.
Повний текст джерелаKang, Yingli [Verfasser]. "Coloring of signed graphs / Yingli Kang." Paderborn : Universitätsbibliothek, 2018. http://d-nb.info/1153824663/34.
Повний текст джерелаOmeroglu, Nurettin Burak. "K-way Partitioning Of Signed Bipartite Graphs." Master's thesis, METU, 2012. http://etd.lib.metu.edu.tr/upload/12614817/index.pdf.
Повний текст джерелаКниги з теми "THEORY OF SIGNED GRAPHS"
Graphs. 2nd ed. Amsterdam: North Holland, 1985.
Знайти повний текст джерелаKandasamy, W. B. Vasantha. Groups as graphs. Slatina, Judetul Olt, Romania: Editura CuArt, 2009.
Знайти повний текст джерелаCvetković, Dragoš M. Eigenspaces of graphs. Cambridge: Cambridge University Press, 2008.
Знайти повний текст джерелаPesch, Erwin. Retracts of graphs. Frankfurt am Main: Athenaum, 1988.
Знайти повний текст джерелаCvetković, Dragoš M. Eigenspaces of graphs. Cambridge: Cambridge University Press, 1997.
Знайти повний текст джерелаBorinsky, Michael. Graphs in Perturbation Theory. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-03541-9.
Повний текст джерелаThulasiraman, K., and M. N. S. Swamy. Graphs: Theory and Algorithms. Hoboken, NJ, USA: John Wiley & Sons, Inc., 1992. http://dx.doi.org/10.1002/9781118033104.
Повний текст джерелаS, Swamy M. N., ed. Graphs: Theory and algorithms. New York: Wiley, 1992.
Знайти повний текст джерелаBerge, Claude. The theory of graphs. Mineola, N.Y: Dover, 2001.
Знайти повний текст джерелаH, Haemers Willem, and SpringerLink (Online service), eds. Spectra of Graphs. New York, NY: Andries E. Brouwer and Willem H. Haemers, 2012.
Знайти повний текст джерелаЧастини книг з теми "THEORY OF SIGNED GRAPHS"
Pranjali and Amit Kumar. "Algebraic Signed Graphs: A Review." In Recent Advancements in Graph Theory, 261–71. Boca Raton : CRC Press, 2020. | Series: Mathematical engineering, manufacturing, and management sciences: CRC Press, 2020. http://dx.doi.org/10.1201/9781003038436-22.
Повний текст джерелаNaserasr, Reza, Edita Rollovâ, and Éric Sopena. "Homomorphisms of signed bipartite graphs." In The Seventh European Conference on Combinatorics, Graph Theory and Applications, 345–50. Pisa: Scuola Normale Superiore, 2013. http://dx.doi.org/10.1007/978-88-7642-475-5_55.
Повний текст джерелаVijayakumar, G. R., and N. M. Singhi. "Some Recent Results on Signed Graphs with Least Eigenvalues ≥ -2." In Coding Theory and Design Theory, 213–18. New York, NY: Springer New York, 1990. http://dx.doi.org/10.1007/978-1-4613-8994-1_16.
Повний текст джерелаNaserasr, Reza, Edita Rollová, and Éric Sopena. "On homomorphisms of planar signed graphs to signed projective cubes." In The Seventh European Conference on Combinatorics, Graph Theory and Applications, 271–76. Pisa: Scuola Normale Superiore, 2013. http://dx.doi.org/10.1007/978-88-7642-475-5_44.
Повний текст джерелаSteffen, Eckhard, and Michael Schubert. "Nowhere-zero flows on signed regular graphs." In The Seventh European Conference on Combinatorics, Graph Theory and Applications, 621–22. Pisa: Scuola Normale Superiore, 2013. http://dx.doi.org/10.1007/978-88-7642-475-5_102.
Повний текст джерелаAgrawal, Kalin, and William H. Batchelder. "Cultural Consensus Theory: Aggregating Signed Graphs under a Balance Constraint." In Social Computing, Behavioral - Cultural Modeling and Prediction, 53–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29047-3_7.
Повний текст джерелаBonchi, Filippo, Paweł Sobociński, and Fabio Zanasi. "A Categorical Semantics of Signal Flow Graphs." In CONCUR 2014 – Concurrency Theory, 435–50. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44584-6_30.
Повний текст джерелаda Silva, Ilda P. F. "Reconstruction of a Rank 3 Oriented Matroids from its Rank 2 Signed Circuits." In Graph Theory in Paris, 355–64. Basel: Birkhäuser Basel, 2006. http://dx.doi.org/10.1007/978-3-7643-7400-6_28.
Повний текст джерелаRahaman, Inzamam, and Patrick Hosein. "Extending DeGroot Opinion Formation for Signed Graphs and Minimizing Polarization." In Complex Networks & Their Applications IX, 298–309. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-65351-4_24.
Повний текст джерелаAlam, Jahangir, Guoqing Hu, Hafiz Md Hasan Babu, and Huazhong Xu. "Automatic Control Systems, Block Diagrams, and Signal Flow Graphs." In Control Engineering Theory and Applications, 161–204. Boca Raton: CRC Press, 2022. http://dx.doi.org/10.1201/9781003293859-3.
Повний текст джерелаТези доповідей конференцій з теми "THEORY OF SIGNED GRAPHS"
Varma, Rohan A., and Jelena Kovacevic. "SAMPLING THEORY FOR GRAPH SIGNALS ON PRODUCT GRAPHS." In 2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP). IEEE, 2018. http://dx.doi.org/10.1109/globalsip.2018.8646362.
Повний текст джерелаNarang, Sunil K., and Antonio Ortega. "Downsampling graphs using spectral theory." In ICASSP 2011 - 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2011. http://dx.doi.org/10.1109/icassp.2011.5947281.
Повний текст джерелаPena, Rodrigo, Xavier Bresson та Pierre Vandergheynst. "Source localization on graphs via ℓ1 recovery and spectral graph theory". У 2016 IEEE 12th Image, Video, and Multidimensional Signal Processing Workshop (IVMSP). IEEE, 2016. http://dx.doi.org/10.1109/ivmspw.2016.7528230.
Повний текст джерелаSusymary, J., and R. Lawrance. "Graph theory analysis of protein-protein interaction graphs through clustering method." In 2017 IEEE International Conference on Intelligent Techniques in Control, Optimization and Signal Processing (INCOS). IEEE, 2017. http://dx.doi.org/10.1109/itcosp.2017.8303125.
Повний текст джерелаVaidyanathan, Palghat P., and Oguzhan Teke. "Extending classical multirate signal processing theory to graphs." In Wavelets and Sparsity XVII, edited by Yue M. Lu, Manos Papadakis, and Dimitri Van De Ville. SPIE, 2017. http://dx.doi.org/10.1117/12.2272362.
Повний текст джерелаKotzagiannidis, Madeleine S., and Pier Luigi Dragotti. "The graph FRI framework-spline wavelet theory and sampling on circulant graphs." In 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2016. http://dx.doi.org/10.1109/icassp.2016.7472904.
Повний текст джерелаTan, Yu, Nicholas Chua, Clarence Koh, and Anand Bhojan. "RTSDF: Real-time Signed Distance Fields for Soft Shadow Approximation in Games." In 17th International Conference on Computer Graphics Theory and Applications. SCITEPRESS - Science and Technology Publications, 2022. http://dx.doi.org/10.5220/0010996200003124.
Повний текст джерелаLoeliger, Hans-Andrea, and C. Reller. "Signal processing with factor graphs: Beamforming and Hilbert transform." In 2013 Information Theory and Applications Workshop (ITA 2013). IEEE, 2013. http://dx.doi.org/10.1109/ita.2013.6502952.
Повний текст джерелаWu, Guohua, Liguo Zhang, and Jiejuan Tong. "Online Fault Diagnosis of Nuclear Power Plants Using Signed Directed Graph and Fuzzy Theory." In 2017 25th International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/icone25-66367.
Повний текст джерелаMiller, Benjamin A., Nadya T. Bliss, and Patrick J. Wolfe. "Toward signal processing theory for graphs and non-Euclidean data." In 2010 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 2010. http://dx.doi.org/10.1109/icassp.2010.5494930.
Повний текст джерелаЗвіти організацій з теми "THEORY OF SIGNED GRAPHS"
Gennip, Yves van, Nestor Guillen, Braxton Osting, and Andrea L. Bertozzi. Mean Curvature, Threshold Dynamics, and Phase Field Theory on Finite Graphs. Fort Belvoir, VA: Defense Technical Information Center, June 2013. http://dx.doi.org/10.21236/ada581612.
Повний текст джерелаMesbahi, Mehran. Dynamic Security and Robustness of Networked Systems: Random Graphs, Algebraic Graph Theory, and Control over Networks. Fort Belvoir, VA: Defense Technical Information Center, February 2012. http://dx.doi.org/10.21236/ada567125.
Повний текст джерелаPerl, Avichai, Bruce I. Reisch, and Ofra Lotan. Transgenic Endochitinase Producing Grapevine for the Improvement of Resistance to Powdery Mildew (Uncinula necator). United States Department of Agriculture, January 1994. http://dx.doi.org/10.32747/1994.7568766.bard.
Повний текст джерелаChristensen, Lance. PR-459-133750-R03 Fast Accurate Automated System To Find And Quantify Natural Gas Leaks. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), November 2019. http://dx.doi.org/10.55274/r0011633.
Повний текст джерелаHrebeniuk, Bohdan V. Modification of the analytical gamma-algorithm for the flat layout of the graph. [б. в.], December 2018. http://dx.doi.org/10.31812/123456789/2882.
Повний текст джерелаCram, Jana, Mary Levandowski, Kaci Fitzgibbon, and Andrew Ray. Water resources summary for the Snake River and Jackson Lake Reservoir in Grand Teton National Park and John D. Rockefeller, Jr. Memorial Parkway: Preliminary analysis of 2016 data. National Park Service, June 2021. http://dx.doi.org/10.36967/nrr-2285179.
Повний текст джерелаBoyle, M., and Elizabeth Rico. Terrestrial vegetation monitoring at Cumberland Island National Seashore: 2020 data summary. National Park Service, September 2022. http://dx.doi.org/10.36967/2294287.
Повний текст джерелаBoyle, Maxwell, and Elizabeth Rico. Terrestrial vegetation monitoring at Fort Pulaski National Monument: 2019 data summary. National Park Service, December 2021. http://dx.doi.org/10.36967/nrds-2288716.
Повний текст джерелаBoyle, Maxwell, and Elizabeth Rico. Terrestrial vegetation monitoring at Cape Hatteras National Seashore: 2019 data summary. National Park Service, January 2022. http://dx.doi.org/10.36967/nrr-2290019.
Повний текст джерелаKapulnik, Yoram, Maria J. Harrison, Hinanit Koltai, and Joseph Hershenhorn. Targeting of Strigolacatones Associated Pathways for Conferring Orobanche Resistant Traits in Tomato and Medicago. United States Department of Agriculture, July 2011. http://dx.doi.org/10.32747/2011.7593399.bard.
Повний текст джерела