58,871 Hits in 3.3 sec

On nearly regular co-critical graphs

Tibor Szabó
1996 Discrete Mathematics  
A graph G is called (K 3, K3)-co-critical if the edges of G can be coloured with two colours without getting a monochromatic triangle, but adding any new edge to the graph, this kind of 'good' colouring  ...  In this short note we construct (K 3, K3)-co-critical graphs of maximal degree O(n3/4). * Corresponding address. 0012-365X/96/$15.00 ~(2' 1996 Elsevier Science B.V.  ...  It is easy to construct (K3, K3)-co-critical graphs with a linear number of edges (see [-2] question arises: what about the 'nearly regular' co-critical graphs with low edgedensity or what is the smallest  ... 
doi:10.1016/0012-365x(95)00121-c fatcat:rhthb4zvtjgz7ocxkyaolujq7a

Page 7630 of Mathematical Reviews Vol. , Issue 2000k [page]

2000 Mathematical Reviews  
Bipartite graphs considered are 4-cycle-free and domino-free. Digraphs considered are regular and near-regular tournaments, strongly unipathic, and minimally strong.  ...  In this paper, we study the structure of connected edge-domination-critical graphs with cut-vertices.  ... 

Author index to volume 160 (1996)

1996 Discrete Mathematics  
Oxley, On the matroids in which all hyperplanes are binary (Note) (1 3) 265 271 Krasikov, l., Degree conditions for vertex switching reconstruction (Note) T., On nearly regular co-critical graphs (Note  ...  Weakley, Random packing by p-connected p-regular graphs (1-3) 41 47 Bennett, F.E., C.J. Colbourn and L.  ... 
doi:10.1016/0012-365x(96)90028-x fatcat:u744kdd5fvhqzporqrttciio7a

Page 3428 of Mathematical Reviews Vol. , Issue 97F [page]

1997 Mathematical Reviews  
Hung-Lin Fu (RC-NCT-AM; Hsinchu) 97f:05071 05C15 Szabo, Tibor (1-OHS; Columbus, OH) On nearly regular co-critical graphs. (English summary) Discrete Math. 160 (1996), no. 1-3, 279-281.  ...  Summary: “A graph G is called (K3, K3)-co-critical if the edges of G can be coloured with two colours without getting a monochro- matic triangle, but on adding any new edge to the graph, this kind of ‘  ... 

Iterative Views Agreement: An Iterative Low-Rank based Structured Optimization Method to Multi-View Spectral Clustering [article]

Yang Wang, Wenjie Zhang, Lin Wu, Xuemin Lin, Meng Fang, Shirui Pan
2016 arXiv   pre-print
In this paper, 1) we propose a multi-graph laplacian regularized LRR with each graph laplacian corresponding to one view to characterize its local manifold structure. 2) Instead of directly enforcing the  ...  Extensive experiments on real-world multi-view data sets demonstrate its superiority.  ...  Based on the above, we leverage the above graph laplacian regularizer with the low-rank representation.  ... 
arXiv:1608.05560v1 fatcat:5wyey5gvgbfshg2b5fraogn6gm

Architecture of prolamellar bodies in Phaseolus etioplasts

Taiji Ikeda, Susumu Toyama
Akahori in Nissei Sangyo Co., Ltd. for his technical assistance of freeze-fracture method. California, for their valuable suggestions and critical reading of this manuscript,  ...  This is nearly equal to the ratio of 4:5:3.  ... 
doi:10.1508/cytologia.51.163 fatcat:ratxykdcejacrn5mzxphxakk6m

Robust Continuous Co-Clustering [article]

Xiao He, Luis Moreira-Matias
2018 arXiv   pre-print
Moreover, we prove that it can be solved with a near linear time complexity on the input size.  ...  The problem of modeling simultaneously groups of samples and features is known as Co-Clustering. This paper introduces ROCCO - a Robust Continuous Co-Clustering algorithm.  ...  COBRA also learns the representation regularized on both sample and feature graphs.  ... 
arXiv:1802.05036v1 fatcat:mnbmfh4rqfhp5h6zqvsz7mzioi

Page 397 of Photo-Era Magazine : The American Journal of Photography Vol. 14, Issue 6 [page]

1905 Photo-Era Magazine : The American Journal of Photography  
Buy the Photographic Papers MADE BY Che KRotngraph Company 771 EAST 164th STREET, NEW YORK Rot O graph Bromid e _a yield prints so nearly like those of platinum that a difference can hardly be detected  ...  Write for direction sheets and copy of Photo Critic giving fuller information and prices.  ... 

The role of the anti-regular graph in the spectral analysis of threshold graphs

Cesar O. Aguilar, Matthew Ficarra, Natalie Schurman, Brittany Sullivan
2020 Linear Algebra and its Applications  
Using the fact that every threshold graph contains a maximal anti-regular graph, we show that some known results, and new ones, on the spectral properties of threshold graphs can be deduced from (i) the  ...  known results on the eigenvalues of anti-regular graphs, (ii) the subgraph structure of threshold graphs, and (iii) eigenvalue interlacing.  ...  speaking, the critical graphs are almost anti-regular.  ... 
doi:10.1016/j.laa.2019.12.005 fatcat:ju7dwgks65bc7ozoopazkvte3m

Controlling and enhancing synchronization through adaptive phase lags

Alexander C. Kalloniatis, Markus Brede
2019 Physical review. E  
A simple intuitive model emerges based on the interaction between splayed clusters close to a critical point.  ...  Performing numerical simulations with random regular graphs, we find that above a certain connectivity driving via adaptive lags allows for stronger alignment to the external frequency at lower value of  ...  ACKNOWLEDGMENTS One of us (ACK) was supported in this work by a Chief Defence Scientist Fellowship and expresses gratitude for the hospitality of the University of Southampton where much of this work was  ... 
doi:10.1103/physreve.99.032303 fatcat:hjvephutendonpn7ivwet2anpy

On the first stability eigenvalue of closed submanifolds in the Euclidean and hyperbolic spaces

Antonio W. Cunha, Henrique F. de Lima, Fábio R. dos Santos
2017 Differential geometry and its applications  
We develop a method based on spectral graph theory to approximate the eigenvalues and eigenfunctions of the Laplace-Beltrami operator of a compact riemannian manifold.  ...  to the first nonzero eigenvalue of a closed hyperbolic surface of arbitrary genus are Morse functions having the least possible total number of critical points among all Morse functions admitted by such  ...  The underlying graph of the triangulation so obtained is usually nearly regular, and the hyperbolic length of its edges is nearly constant.  ... 
doi:10.1016/j.difgeo.2017.03.002 fatcat:5yppkp5yuvewxasx3xmukbrqva

Optimal Morse functions and H(M^2,A) in Õ(N) time [article]

Abhishek Rathore
2015 arXiv   pre-print
A Morse function is pseudo-optimal if we can obtain an optimal Morse function from it, simply by means of critical cell cancellations.  ...  Moreover, we define a new criterion for nearly optimal Morse functions called pseudo-optimality.  ...  Yet another case is when b 0 [1] and b 0 [2] are both incident on one of the earlier k ears. In this case, b 0 [1] is either or a regular 0-cell and b 0 [2] is certainly a regular cell.  ... 
arXiv:1505.02230v1 fatcat:y5hiyzxkqfaxdmswtw525l7m3a

Notes on Geometric Measure Theory Applications to Image Processing; De-noising, Segmentation, Pattern, Texture, Lines, Gestalt and Occlusion [article]

Simon P Morgan
2006 arXiv   pre-print
Regularization functionals that lower level set boundary length when used with L^1 fidelity functionals on signal de-noising on images create artifacts.  ...  A regularity term to eliminate staircasing can be based upon the mass of the current representing the graph of an image function or its second derivatives.  ...  Fidelity is n.min(2θ, θ n cos θ ) = θ cos θ for large n....n > 1/2cosθ Regularity is nθ So for n > 1/cosθ, the saw tooth will be wiped out in optimization.  ... 
arXiv:cs/0605131v2 fatcat:d7xxdkeltzaj7ganwmwatsmhze

Nonlinear Quantum Search [article]

Thomas G. Wong
2015 arXiv   pre-print
Further, strongly reg graphs, which have no global sym, are sufficiently complete for quant search on them to asymp behave like unstruct search.  ...  These results lead to quant info-theoretic bounds on the phys resources required for these effective nonlin theories to hold, asymp.  ...  and g = √ N / log N on strongly regular graphs at the critical γ. . . 94 Figure 5.8: Evolution of search with a loglinear nonlinearity on a strongly regular graphs with parameters (509,254,126,127). .  ... 
arXiv:1506.04388v1 fatcat:bnpwjxqidja6ziovukeaokttse

A Century of Topological Coevolution of Complex Infrastructure Networks in an Alpine City

Jonatan Zischg, Christopher Klinkhamer, Xianyuan Zhan, P. Suresh C. Rao, Robert Sitzenfrei
2019 Complexity  
The functional topologies of the networks are analyzed based on the dual graphs, providing insights beyond a conventional graph (primal mapping) analysis.  ...  Furthermore, we show the remapping of the dual network characteristics to the spatial map and the identification of criticalities among different network types through co-location analysis and discuss  ...  Negative values indicate a graph with more regular characteristics, whereas positive values indicate more random graph characteristics [31] .  ... 
doi:10.1155/2019/2096749 fatcat:m4qbcg7wwfdgfmg3rdmdxrqyka
« Previous Showing results 1 — 15 out of 58,871 results